213 search results - page 25 / 43 » Agents with Exact Foreknowledge |
AAAI
1998
15 years 5 months ago
1998
People frequently complain that it is too difficult to figure out how to get computers to do what they want. However, with a computer system that actually tries to understand what...
AAAI
1998
15 years 5 months ago
1998
Walsh Transforms measure all sources of nonlinear interactions for functions that have a bit representation. There can be exponentially many nonlinear interactions and exactly com...
140
click to vote
AAAI
1997
15 years 5 months ago
1997
CNF-BCP is a well-known propositional reasoner that extends clausal Boolean Constraint Propagation (BCP) to non-clausal theories. Although BCP has efficient linear-time implementa...
147
click to vote
ATAL
2010
Springer
15 years 5 months ago
2010
Springer
Robotic swarms, like all spatial computers, are a challenging environment for the execution of distributed consensus algorithms due to their scale, diameter, and frequent failures...
142
click to vote
IOR
2006
15 years 3 months ago
2006
The multilevel generalized assignment problem (MGAP) is a variation of the generalized assignment problem, in which agents can execute tasks at different efficiency levels with di...