1884 search results - page 150 / 377 » Simple Algorithm for Simple Timed Games |
177
click to vote
HUMAN
2003
Springer
15 years 10 months ago
2003
Springer
Delivered end-to-end QoS is often limited by the ineffective resource management at Internet end systems. To overcome this problem, we present a resource allocation framework tha...
155
click to vote
SODA
1997
ACM
15 years 6 months ago
1997
ACM
Given a collection S of n line segments in the plane, the planar point location problem is to construct a data structure that can e ciently determine for a given query point p the...
136
click to vote
SODA
2012
ACM
13 years 7 months ago
2012
ACM
The following distributed coalescence protocol was introduced by Dahlia Malkhi in 2006 motivated by applications in social networking. Initially there are n agents wishing to coal...
134
click to vote
COMPGEOM
2009
ACM
15 years 11 months ago
2009
ACM
We consider the problem of computing minimum geometric hitting sets in which, given a set of geometric objects and a set of points, the goal is to compute the smallest subset of p...
153
click to vote
CORR
2010
Springer
15 years 5 months ago
2010
Springer
We give a simple polynomial-time algorithm to exactly count the number of Euler Tours (ETs) of any Eulerian generalized series-parallel graph, and show how to adapt this algorithm...