Sciweavers

10608 search results - page 702 / 2122
» Complexity of O'Hara's Algorithm
Sort
View
COMPGEOM
2009
ACM
16 years 1 months ago
Incremental construction of the delaunay triangulation and the delaunay graph in medium dimension
We describe a new implementation of the well-known incremental algorithm for constructing Delaunay triangulations in any dimension. Our implementation follows the exact computing ...
Jean-Daniel Boissonnat, Olivier Devillers, Samuel ...
PRDC
2007
IEEE
16 years 1 months ago
Failure Detectors and Extended Paxos for k-Set Agreement
Failure detector class Ωk has been defined in [18] as an extension to failure detector Ω, and an algorithm has been given in [16] to solve k-set agreement using Ωk in async...
Wei Chen, Jialin Zhang, Yu Chen, Xuezheng Liu
GECCO
2007
Springer
149views Optimization» more  GECCO 2007»
16 years 1 months ago
Informative performance metrics for dynamic optimisation problems
Existing metrics for dynamic optimisation are designed primarily to rate an algorithm’s overall performance. These metrics show whether one algorithm is better than another, but...
Stefan Bird, Xiaodong Li
VTC
2006
IEEE
117views Communications» more  VTC 2006»
16 years 1 months ago
Simulation of Throughput in UMTS Networks with Different Spreading Factors
— We design and implement a local session1 admission control (SAC) algorithm for third-generation wireless networks which allows for the simulation of network throughput for diff...
Robert Akl, Anurag Arepally
MOBICOM
2006
ACM
16 years 1 months ago
Localization in sparse networks using sweeps
Determining node positions is essential for many next-generation network functionalities. Previous localization algorithms lack correctness guarantees or require network density h...
David Kiyoshi Goldenberg, Pascal Bihler, Yang Rich...