198 search results - page 33 / 40 » Anytime Bounded Rationality |
102
click to vote
QEST
2008
IEEE
15 years 7 months ago
2008
IEEE
We begin by observing that (discrete-time) QuasiBirth-Death Processes (QBDs) are equivalent, in a precise sense, to (discrete-time) probabilistic 1-Counter Automata (p1CAs), and b...
122
Voted
AI
2010
Springer
15 years 24 days ago
2010
Springer
The Valued Constraint Satisfaction Problem (VCSP) is a generic optimization problem defined by a network of local cost functions defined over discrete variables. It has applicatio...
115
Voted
ALGORITHMICA
2010
15 years 24 days ago
2010
We investigate the convergence of the price of anarchy after a limited number of moves in the classical multicast communication game when the underlying communication networks is ...
104
Voted
ATAL
2009
Springer
15 years 7 months ago
2009
Springer
This paper argues that the agent-based simulation approach is just the one appropriate to the social sciences (including economics). Although there were many predecessor approache...
118
Voted
COMPGEOM
1996
ACM
15 years 4 months ago
1996
ACM
We provideO(n)-timealgorithmsfor constructingthe following types of drawings of n-vertex 3-connectedplanar graphs: 2D convex grid drawings with (3n) (3n=2) area under the edge L1-...