547 search results - page 86 / 110 » A Planning Algorithm not based on Directional Search |
123
Voted
CISSE
2008
Springer
15 years 4 months ago
2008
Springer
: Many real world problems appear naturally as constraints satisfaction problems (CSP), for which very efficient algorithms are known. Most of these involve the combination of two ...
148
Voted
SOCIALCOM
2010
15 years 20 days ago
2010
A representation of the World Wide Web as a directed graph, with vertices representing web pages and edges representing hypertext links, underpins the algorithms used by web search...
120
Voted
CADE
2002
Springer
16 years 3 months ago
2002
Springer
The classical NP-complete problem of Boolean Satisfiability (SAT) has seen much interest in not just the theoretical computer science community, but also in areas where practical s...
117
Voted
ICANN
1997
Springer
15 years 7 months ago
1997
Springer
We use simulated soccer to study multiagent learning. Each team's players (agents) share action set and policy but may behave differently due to position-dependent inputs. All...
119
Voted
ATAL
2009
Springer
15 years 9 months ago
2009
Springer
Recent scaling up of decentralized partially observable Markov decision process (DEC-POMDP) solvers towards realistic applications is mainly due to approximate methods. Of this fa...