1884 search results - page 73 / 377 » Simple Algorithm for Simple Timed Games |
140
click to vote
ITRE
2005
IEEE
15 years 9 months ago
2005
IEEE
— Wireless networks are characterized by bursty and location-dependent errors. Although many fair scheduling methods have been proposed to address these issues, most of them assu...
153
Voted
ESA
2005
Springer
15 years 9 months ago
2005
Springer
We introduce a new way to compute common intervals of K permutations based on a very simple and general notion of generators of common intervals. This formalism leads to simple an...
130
click to vote
COCOON
2001
Springer
15 years 8 months ago
2001
Springer
: We consider the following problem. Given a polygon P, possibly with holes, and having n vertices, compute a pair of equal radius disks that do not intersect each other, are conta...
123
click to vote
ASIAN
1999
Springer
15 years 8 months ago
1999
Springer
This paper aims at introducing an extension of M-nets, a fully compositional class of high-level Petri nets, and of its low-level counter part, Petri Boxes Calculus (PBC). We intro...
123
click to vote
FOCS
2006
IEEE
15 years 10 months ago
2006
IEEE
We present new algebraic approaches for several wellknown combinatorial problems, including non-bipartite matching, matroid intersection, and some of their generalizations. Our wo...