3172 search results - page 293 / 635 » On the Random-Self-Reducibility of Complete Sets |
156
click to vote
COCO
2007
Springer
16 years 27 days ago
2007
Springer
Valiant has proposed a new theory of algorithmic computation based on perfect matchings and Pfaffians. We study the properties of matchgates—the basic building blocks in this n...
159
click to vote
COCOON
2007
Springer
16 years 27 days ago
2007
Springer
We consider the problem of scheduling a set of equal-length intervals arriving online, where each interval is associated with a weight and the objective is to maximize the total we...
161
click to vote
CONCUR
2007
Springer
16 years 27 days ago
2007
Springer
Dπ is a simple distributed extension of the π-calculus in which agents are explicitly located, and may use an explicit migration construct to move between locations. In this pap...
175
click to vote
COSIT
2007
Springer
16 years 27 days ago
2007
Springer
Cavities in spatial phenomena require geometric representations of regions with holes. Existing models for reasoning over topological relations either exclude such specialized regi...
188
Voted
CP
2007
Springer
16 years 27 days ago
2007
Springer
The techniques for making decisions, i.e., branching, play a central role in complete methods for solving structured CSP instances. In practice, there are cases when SAT solvers be...