206 search results - page 31 / 42 » Weak Alternating Automata Are Not That Weak |
OOPSLA
2009
Springer
14 years 3 days ago
2009
Springer
During its formative decades the software community looked twice to the theories of ChristopherAlexander for inspiration, both times failing to completely master the architect’s...
CP
1998
Springer
13 years 11 months ago
1998
Springer
Abstract. We study the experimental consequences of a recent theoretical result by Achlioptas et al. that shows that conventional models of random problems are trivially insoluble ...
CRYPTO
1992
Springer
13 years 11 months ago
1992
Springer
Abstract Joseph Kilian NEC Research Princeton, NJ 08540 Tom Leighton Mathematics Department Laboratory for Computer Science MIT Cambridge, MA 02139 August 17, 1994 Fair" Publ...
ATAL
2007
Springer
13 years 11 months ago
2007
Springer
Consumers use service selection mechanisms to decide on a service provider to interact with. Although there are various service selection mechanisms, each mechanism has different s...
RTA
2010
Springer
13 years 11 months ago
2010
Springer
Infinitary Term Rewriting allows to express infinitary terms and infinitary reductions that converge to them. As their notion of transfinite reduction in general, and as binary...