6693 search results - page 17 / 1339 » On an anytime algorithm for control |
94
Voted
AAAI
2000
15 years 1 months ago
2000
We develop a normative theory of interaction-negotiation in particular--among self-interested computationally limited agents where computational actions are game-theoretically tre...
CATS
2007
15 years 1 months ago
2007
This paper provides a theoretical basis for performing time limited planning within Belief-Desire-Intention (BDI) agents. The BDI agent architecture is recognised as one of the mo...
111
click to vote
CSL
2001
Springer
15 years 4 months ago
2001
Springer
Abstract. In classical approaches to knowledge representation, reasoners are assumed to derive all the logical consequences of their knowledge base. As a result, reasoning in the ï...
119
click to vote
AAAI
2000
15 years 1 months ago
2000
Depth-first branch-and-bound (DFBnB) is a complete algorithm that is typically used to find optimal solutions of difficult combinatorial optimization problems. It can also be adap...
102
click to vote
FGCS
2008
14 years 11 months ago
2008
The purpose of ubiquitous computing is anywhere and anytime access to information within computing infrastructures that is blended into a background and no longer be reminded. Thi...