1092 search results - page 113 / 219 » Polynomial Interpretations and the Complexity of Algorithms |
149
click to vote
ICLP
1997
Springer
15 years 10 months ago
1997
Springer
Hybrid Probabilistic Programs (HPPs) are logic programs that allow the programmer to explicitly encode his knowledge of the dependencies between events being described in the prog...
190
click to vote
WSC
2004
15 years 7 months ago
2004
Group behaviors, e.g. birds flocking, are widely used in virtual reality, computer games, robotics and artificial life. While many methods to simulate group behaviors have been pr...
164
Voted
FOCS
1991
IEEE
15 years 9 months ago
1991
IEEE
We wish to increase the power of an arbitrary algorithm designed for non-degenerate input, by allowing it to execute on all inputs. We concentrate on in nitesimal symbolic perturba...
275
click to vote
FOSSACS
2011
Springer
14 years 9 months ago
2011
Springer
Traditional automata accept or reject their input, and are therefore Boolean. In contrast, weighted automata map each word to a value from a semiring over a large domain. The speci...
191
Voted
GLOBECOM
2007
IEEE
15 years 10 months ago
2007
IEEE
Recently, cooperative routing in wireless networks has gained much interest due to its ability to exploit the broadcast nature of the wireless medium in designing powerefficient ro...