Sciweavers

1568 search results - page 61 / 314
» The problem of examination questions in algorithmics
Sort
View
ICALP
2005
Springer
16 years 7 days ago
How Well Can Primal-Dual and Local-Ratio Algorithms Perform?
We define an algorithmic paradigm, the stack model, that captures many primal-dual and local-ratio algorithms for approximating covering and packing problems. The stack model is ...
Allan Borodin, David Cashman, Avner Magen
SODA
2012
ACM
200views Algorithms» more  SODA 2012»
13 years 9 months ago
The shifting sands algorithm
We resolve the problem of small-space approximate selection in random-order streams. Specifically, we present an algorithm that reads the n elements of a set in random order and ...
Andrew McGregor, Paul Valiant
SIGMOD
2004
ACM
121views Database» more  SIGMOD 2004»
16 years 6 months ago
An Optimal Algorithm for Querying Tree Structures and its Applications in Bioinformatics
Trees and graphs are widely used to model biological databases. Providing efficient algorithms to support tree-based or graph-based querying is therefore an important issue. In th...
Hsiao-Fei Liu, Ya-Hui Chang, Kun-Mao Chao
GECCO
2007
Springer
166views Optimization» more  GECCO 2007»
16 years 26 days ago
EcoPS: a particle swarm algorithm to model group-foraging
Recent work has introduced a simulation model of ecological processes in terms of a very simple Particle Swarm algorithm. This abstract model produced qualitatively realistic beha...
Cecilia Di Chio, Riccardo Poli, Paolo Di Chio
IEEEPACT
2008
IEEE
16 years 1 months ago
Multitasking workload scheduling on flexible-core chip multiprocessors
While technology trends have ushered in the age of chip multiprocessors (CMP) and enabled designers to place an increasing number of cores on chip, a fundamental question is what ...
Divya Gulati, Changkyu Kim, Simha Sethumadhavan, S...