15033 search results - page 74 / 3007 » Complexity Theory and Algorithms |
111
Voted
SPAA
2004
ACM
15 years 9 months ago
2004
ACM
Given two admission control algorithms that are cA-acceptcompetitive and cR-reject-competitive respectively, we give two ways to make an algorithm that is simultaneously O(cA)acce...
122
Voted
PODC
2009
ACM
16 years 4 months ago
2009
ACM
Peer-to-peer systems rely on scalable overlay networks that enable efficient routing between its members. Hypercubic topologies facilitate such operations while each node only nee...
156
Voted
COMPGEOM
2005
ACM
15 years 5 months ago
2005
ACM
Star splaying is a general-dimensional algorithm that takes as input a triangulation or an approximation of a convex hull, and produces the Delaunay triangulation, weighted Delaun...
136
click to vote
LFCS
2007
Springer
15 years 9 months ago
2007
Springer
Abstract. Balanced search trees provide guaranteed worst-case time performance and hence they form a very important class of data structures. However, the self-balancing ability co...
157
Voted
EUROGP
2007
Springer
15 years 5 months ago
2007
Springer
Geometric particle swarm optimization (GPSO) is a recently introduced formal generalization of traditional particle swarm optimization (PSO) that applies naturally to both continu...