2252 search results - page 201 / 451 » Lower Bounds for Dynamic Algorithms |
126
Voted
EVOW
2010
Springer
15 years 10 months ago
2010
Springer
Genetic algorithms (GAs) share a common weakness with most other metaheuristics: Candidate solutions are in general revisited multiple times, lowering diversity and wasting preciou...
134
Voted
INTEGRATION
2007
15 years 3 months ago
2007
In this paper, we present a method of rectilinear block packing using selected sequence-pair (SSP), a rectangle packing representation. We also propose a fast algorithm to obtain ...
117
Voted
IPCCC
2007
IEEE
15 years 10 months ago
2007
IEEE
In this paper, we study the Maximum lifetime Target Coverage problem (MTC), which is to maximize the network lifetime while guaranteeing the complete coverage of all the targets. ...
111
Voted
VLDB
1997
ACM
15 years 7 months ago
1997
ACM
The cpquantile of an ordered sequenceof data values is the element with rank ‘pn, where n is the total number of values. Accurate estimates of quantiles are required for the sol...
167
Voted
LATIN
2010
Springer
15 years 5 months ago
2010
Springer
We study the problem of designing truthful algorithms for scheduling a set of tasks, each one owned by a selfish agent, to a set of parallel (identical or unrelated) machines in or...