1866 search results - page 182 / 374 » Robust Algorithms and Price of Robustness in Shunting Proble... |
160
click to vote
COMPGEOM
2003
ACM
15 years 11 months ago
2003
ACM
We develop algorithms for computing the smallest enclosing ball of a set of n balls in d-dimensional space. Unlike previous methods, we explicitly address small cases (n ≤ d + 1...
199
click to vote
TWC
2008
15 years 6 months ago
2008
A novel framework was introduced recently for stochastic routing in wireless multihop networks, whereby each node selects a neighbor to forward a packet according to a probability...
172
click to vote
CEC
2010
IEEE
15 years 4 months ago
2010
IEEE
Abstract-- We present a case study demonstrating that using the REVAC parameter tuning method we can greatly improve the `world champion' EA (the winner of the CEC2005 competi...
157
click to vote
COMPGEOM
2009
ACM
16 years 1 months ago
2009
ACM
We describe a new implementation of the well-known incremental algorithm for constructing Delaunay triangulations in any dimension. Our implementation follows the exact computing ...
179
click to vote
CVPR
2005
IEEE
16 years 8 months ago
2005
IEEE
Scale-spaces induced by diffusion processes play an important role in many computer vision tasks. Automatically selecting the most appropriate scale for a particular problem is a ...