1220 search results - page 73 / 244 » Restricting grammatical complexity |
POPL
2006
ACM
14 years 8 months ago
2006
ACM
Abstract. This paper investigates what is essentially a call-by-value version of PCF under a complexity-theoretically motivated type system. The programming formalism, ATR, has its...
SIGMOD
2009
ACM
14 years 8 months ago
2009
ACM
Whether beloved or despised, XML Schema is momentarily the only industrially accepted schema language for XML and is unlikely to become obsolete any time soon. Nevertheless, many ...
ATAL
2009
Springer
14 years 2 months ago
2009
Springer
Decentralized partially observable MDPs (DEC-POMDPs) provide a rich framework for modeling decision making by a team of agents. Despite rapid progress in this area, the limited sc...
ICRA
2007
IEEE
14 years 2 months ago
2007
IEEE
Abstract— The problem of an effective coordination of multiple autonomous robots is one of the most important tasks of the modern robotics. In turn, it is well known that the lea...
CP
2005
Springer
14 years 1 months ago
2005
Springer
QBF is the problem of deciding the satisfiability of quantified boolean formulae in which variables can be either universally or existentially quantified. QBF generalizes SAT (S...