2168 search results - page 111 / 434 » Randomized Algorithms and Complexity Theory |
136
click to vote
AAAI
1994
15 years 4 months ago
1994
Many real-life Constraint Satisfaction Problems (CSPs) involve some constraints similar to the alldifferent constraints. These constraints are called constraints of difference. Th...
146
click to vote
IFM
2010
Springer
15 years 1 months ago
2010
Springer
Abstract. The automata-based model checking approach for randomized distributed systems relies on an operational interleaving semantics of the system by means of a Markov decision ...
155
Voted
COMPGEOM
2008
ACM
15 years 5 months ago
2008
ACM
The Delaunay triangulation and its dual the Voronoi diagram are ubiquitous geometric complexes. From a topological standpoint, the connection has recently been made between these ...
144
Voted
MOBIHOC
2008
ACM
16 years 2 months ago
2008
ACM
It has been an important research topic since 1992 to maximize stability region in constrained queueing systems, which includes the study of scheduling over wireless ad hoc networ...
130
click to vote
PODC
2005
ACM
15 years 8 months ago
2005
ACM
We study the distributed complexity of computing a maximal independent set (MIS) in radio networks with completely unknown topology, asynchronous wake-up, and no collision detecti...