11345 search results - page 2148 / 2269 » Foundations of Computer Science |
113
Voted
LICS
2009
IEEE
15 years 9 months ago
2009
IEEE
We consider the standard model of finite two-person zero-sum stochastic games with signals. We are interested in the existence of almost-surely winning or positively winning stra...
149
Voted
LICS
2009
IEEE
15 years 9 months ago
2009
IEEE
Weighted automata are nondeterministic automata with numerical weights on transitions. They can define quantitative languages L that assign to each word w a real number L(w). In ...
92
Voted
ATAL
2009
Springer
15 years 9 months ago
2009
Springer
We study combinatorial prediction markets where agents bet on the sum of values at any tree node in a hierarchy of events, for example the sum of page views among all the children...
121
Voted
COCO
2009
Springer
15 years 9 months ago
2009
Springer
Graph Isomorphism is the prime example of a computational problem with a wide difference between the best known lower and upper bounds on its complexity. There is a significant ...
105
Voted
COCO
2009
Springer
15 years 9 months ago
2009
Springer
Devising an efficient deterministic – or even a nondeterministic sub-exponential time – algorithm for testing polynomial identities is a fundamental problem in algebraic comp...