6312 search results - page 985 / 1263 » A design framework for metaheuristics |
173
click to vote
STOC
2005
ACM
16 years 7 months ago
2005
ACM
In combinatorial optimization, a popular approach to NP-hard problems is the design of approximation algorithms. These algorithms typically run in polynomial time and are guarante...
168
click to vote
STOC
2004
ACM
16 years 7 months ago
2004
ACM
We investigate the design of algorithms resilient to memory faults, i.e., algorithms that, despite the corruption of some memory values during their execution, are able to produce...
163
click to vote
OSDI
2004
ACM
16 years 7 months ago
2004
ACM
FFPF is a network monitoring framework designed for three things: speed (handling high link rates), scalability (ability to handle multiple applications) and flexibility. Multiple...
286
click to vote
SIGMOD
2007
ACM
16 years 6 months ago
2007
ACM
Top-k processing in uncertain databases is semantically and computationally different from traditional top-k processing. The interplay between query scores and data uncertainty ma...
280
click to vote
SIGMOD
2007
ACM
16 years 6 months ago
2007
ACM
Imagine that you have been entrusted with private data, such as corporate product information, sensitive government information, or symptom and treatment information about hospita...