2137 search results - page 361 / 428 » Approximation Algorithms for Some Graph Partitioning Problem... |
110
click to vote
GD
2005
Springer
15 years 8 months ago
2005
Springer
Most graph layout algorithms treat nodes as points. The problem of node overlap removal is to adjust the layout generated by such methods so that nodes of non-zero width and height...
142
click to vote
SIGMETRICS
2008
ACM
15 years 2 months ago
2008
ACM
Fine-grained network measurement requires routers and switches to update large arrays of counters at very high link speed (e.g. 40 Gbps). A naive algorithm needs an infeasible amo...
125
Voted
ATAL
2010
Springer
15 years 3 months ago
2010
Springer
Memory-bounded techniques have shown great promise in solving complex multi-agent planning problems modeled as DEC-POMDPs. Much of the performance gains can be attributed to pruni...
103
click to vote
ECP
1997
Springer
15 years 6 months ago
1997
Springer
It is traditional wisdom that one should start from the goals when generating a plan in order to focus the plan generation process on potentially relevant actions. The graphplan sy...
235
Voted
VLDB
2006
ACM
16 years 2 months ago
2006
ACM
Abstract Traditional nearest-neighbor (NN) search is based on two basic indexing approaches: object-based indexing and solution-based indexing. The former is constructed based on t...