8699 search results - page 1383 / 1740 » Elements of the Theory of Computation |
177
click to vote
KER
2007
15 years 6 months ago
2007
AI planning solves the problem of generating a correct and efficient ordered set of instantiated activities, from a knowledge base of generic actions, which when executed will tra...
206
click to vote
CORR
2004
Springer
15 years 6 months ago
2004
Springer
Words and phrases acquire meaning from the way they are used in society, from their relative semantics to other words and phrases. For computers the equivalent of `society' is...
198
click to vote
MST
2010
15 years 5 months ago
2010
Reductions and completeness notions form the heart of computational complexity theory. Recently non-uniform reductions have been naturally introduced in a variety of settings conc...
202
click to vote
SAGT
2010
Springer
15 years 5 months ago
2010
Springer
Abstract. One reason for wanting to compute an (approximate) Nash equilibrium of a game is to predict how players will play. However, if the game has multiple equilibria that are f...
191
click to vote
SIGMETRICS
2010
ACM
15 years 5 months ago
2010
ACM
We introduce and analyze a deterministic fluid model that serves as an approximation for the Gt/GI/st + GI manyserver queueing model, which has a general time-varying arrival pro...