198 search results - page 35 / 40 » Anytime Bounded Rationality |
MFCS
2007
Springer
15 years 3 months ago
2007
Springer
In formal language theory, many families of languages are defined using grammars or finite acceptors like pushdown automata and Turing machines. For instance, context-sensitive l...
WADS
2005
Springer
15 years 3 months ago
2005
Springer
We obtain subquadratic algorithms for 3SUM on integers and rationals in several models. On a standard word RAM with w-bit words, we obtain a running time of O(n2 / max{ w lg2 w , ...
SIGECOM
2004
ACM
15 years 3 months ago
2004
ACM
In many market settings, agents do not know their preferences a priori. Instead, they may have to solve computationally complex optimization problems, query databases, or perform ...
ATAL
2004
Springer
15 years 3 months ago
2004
Springer
Product Distribution (PD) theory is a new framework for controlling Multi-Agent Systems (MAS’s). First we review one motivation of PD theory, as the information-theoretic extens...
FC
2010
Springer
15 years 1 months ago
2010
Springer
Despite the conventional wisdom that proactive security is superior to reactive security, we show that reactive security can be competitive with proactive security as long as the r...