7150 search results - page 1398 / 1430 » An Approximation Algorithm for Approximation Rank |
ATAL
2003
Springer
15 years 5 months ago
2003
Springer
Auctions are an important means for purchasing material in the era of e-commerce. Research on auctions often studies them in isolation. In practice, however, auction agents are pa...
BIRTHDAY
2003
Springer
15 years 5 months ago
2003
Springer
The pagination problem of complex documents is in placing text and floating objects on pages in such a way that each object appears close to, but not before, its text reference. ...
COCO
2003
Springer
15 years 5 months ago
2003
Springer
We continue an investigation of resource-bounded Kolmogorov complexity and derandomization techniques begun in [2, 3]. We introduce nondeterministic time-bounded Kolmogorov comple...
109
click to vote
GECCO
2003
Springer
15 years 5 months ago
2003
Springer
The performance of genetic programming relies mostly on population-contained variation. If the population diversity is low then there will be a greater chance of the algorithm bein...
122
click to vote
FOCS
2002
IEEE
15 years 5 months ago
2002
IEEE
In recent years, gossip-based algorithms have gained prominence as a methodology for designing robust and scalable communication schemes in large distributed systems. The premise ...