10608 search results - page 703 / 2122 » Complexity of O'Hara's Algorithm |
185
click to vote
GD
2005
Springer
16 years 29 days 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...
192
click to vote
GECCO
2005
Springer
16 years 29 days ago
2005
Springer
In this study, we introduce two improved assessment metrics of multiobjective optimizers, Nondominated Ratio and Spacing Distribution, and analyze their rationality and validity. ...
203
click to vote
DIALM
2004
ACM
16 years 26 days ago
2004
ACM
In this paper, we consider energy-efficient gathering of correlated data in sensor networks. We focus on single-input coding strategies in order to aggregate correlated data. For ...
195
click to vote
HIPC
2003
Springer
16 years 20 days ago
2003
Springer
Many complex real-time applications involve combined scheduling of hard and soft real-time tasks. In this paper, we propose a combined scheduling algorithm, called Emergency Algori...
200
click to vote
COMPGEOM
1993
ACM
15 years 11 months ago
1993
ACM
We give a practical and provably good Monte Carlo algorithm for approximating center points. Let P be a set of n points in IRd . A point c ∈ IRd is a β-center point of P if eve...