34170 search results - page 6206 / 6834 » Optimization |
209
click to vote
STOC
2007
ACM
16 years 7 months ago
2007
ACM
Given as input a directed graph on N vertices and a set of source-destination pairs, we study the problem of routing the maximum possible number of source-destination pairs on pat...
217
click to vote
STOC
2002
ACM
16 years 7 months ago
2002
ACM
We present improved algorithms for maintaining transitive closure and all-pairs shortest paths/distances in a digraph under deletion of edges. For the problem of transitive closur...
242
click to vote
SAC
2004
ACM
16 years 27 days ago
2004
ACM
A popular solution to internet performance problems is the widespread caching of data. Many caching algorithms have been proposed in the literature, most attempting to optimize fo...
182
click to vote
COCO
2003
Springer
16 years 21 days ago
2003
Springer
We consider a fundamental problem in data structures, static predecessor searching: Given a subset S of size n from the universe [m], store S so that queries of the form “What i...
215
click to vote
GECCO
1999
Springer
15 years 11 months ago
1999
Springer
Genetic programming makes it possible to automatically search the space of possible programs. First we evolved a behavior-based control architecture using computer simulations. Th...