832 search results - page 17 / 167 » Parallel algorithms for solving aggregated shortest-path pro... |
PPSN
2004
Springer
15 years 3 months ago
2004
Springer
It is typical for the EA community that theory follows experiments. Most theoretical approaches use some model of the considered evolutionary algorithm (EA) but there is also some ...
WWW
2005
ACM
15 years 10 months ago
2005
ACM
Focused crawlers are considered as a promising way to tackle the scalability problem of topic-oriented or personalized search engines. To design a focused crawler, the choice of s...
202
click to vote
Lecture Notes
"This course will consist of a number of major sections. The first will be a short review of some preliminary material, including asymptotics, summations, and recurrences and ...
ISAAC
2005
Springer
15 years 3 months ago
2005
Springer
Abstract. We consider bicriteria optimization problems and investigate the relationship between two standard approaches to solving them: (i) computing the Pareto curve and (ii) the...
CORR
2008
Springer
14 years 9 months ago
2008
Springer
We provide linear-time algorithms for geometric graphs with sublinearly many crossings. That is, we provide algorithms running in O(n) time on connected geometric graphs having n ...