9849 search results - page 350 / 1970 » Algorithms and Experiments for the Webgraph |
200
click to vote
JPDC
2011
14 years 10 months ago
2011
: One important problem which may arise in designing a deployment strategy for a wireless sensor network is how to deploy a specific number of sensor nodes throughout an unknown ne...
247
click to vote
COMGEO
2012
ACM
14 years 3 months ago
2012
ACM
We study a class of multi-commodity flow problems in geometric domains: For a given planar domain P populated with obstacles (holes) of K ≥ 2 types, compute a set of thick path...
193
click to vote
GECCO
2005
Springer
16 years 1 months ago
2005
Springer
This paper describes our procedure and a software application for conducting large parameter sweep experiments in genetic and evolutionary computation research. Both procedure and...
179
click to vote
GD
2000
Springer
15 years 11 months ago
2000
Springer
The merit of automatic graph layout algorithms is typically judged on their computational efficiency and the extent to which they conform to aesthetic criteria (for example, minimi...
213
click to vote
JGAA
2002
15 years 7 months ago
2002
The merit of automatic graph layout algorithms is typically judged by their computational efficiency and the extent to which they conform to aesthetic criteria (for example, minim...