211 search results - page 36 / 43 » Solving Games Without Determinization |
101
click to vote
STOC
2009
ACM
15 years 11 months ago
2009
ACM
We consider matrix groups, specified by a list of generators, over finite fields. The two most basic questions about such groups are membership in and the order of the group. Even...
PODS
2007
ACM
15 years 10 months ago
2007
ACM
The generalized hypertree width GHW(H) of a hypergraph H is a measure of its cyclicity. Classes of conjunctive queries or constraint satisfaction problems whose associated hypergr...
PODS
2008
ACM
15 years 10 months ago
2008
ACM
A fundamental problem in distributed computation is the distributed evaluation of functions. The goal is to determine the value of a function over a set of distributed inputs, in ...
OPODIS
2003
14 years 11 months ago
2003
The Rendezvous of anonymous mobile agents in a anonymous network is an intensively studied problem; it calls for k anonymous, mobile agents to gather in the same site. We study thi...
BMCBI
2010
14 years 10 months ago
2010
Background: Many protein structures determined in high-throughput structural genomics centers, despite their significant novelty and importance, are available only as PDB depositi...