2693 search results - page 69 / 539 » On Computing Complex Navigation Functions |
ICALP
2009
Springer
14 years 10 months ago
2009
Springer
Ong has shown that the modal mu-calculus model checking problem (equivalently, the alternating parity tree automaton (APT) acceptance problem) of possibly-infinite ranked trees gen...
ICALP
2007
Springer
14 years 4 months ago
2007
Springer
This paper studies the gap between classical one-way communication complexity C(f) and its quantum counterpart Q(f), under the unbounded-error setting, i.e., it is enough that the ...
JACM
2002
13 years 9 months ago
2002
An exponential lower bound on the circuit complexity of deciding the weak monadic second-order theory of one successor (WS1S) is proved. Circuits are built from binary operations, ...
LCN
2007
IEEE
14 years 4 months ago
2007
IEEE
—This paper presents a distributed algorithm to direct evacuees to exits through arbitrarily complex building layouts in emergency situations. The algorithm finds the safest pat...
RECOMB
2008
Springer
14 years 10 months ago
2008
Springer
Abstract. Clusters of genes that evolved from single progenitors via repeated segmental duplications present significant challenges to the generation of a truly complete human geno...