Sciweavers

6693 search results - page 17 / 1339
» On an anytime algorithm for control
Sort
View
AAAI
2000
13 years 9 months ago
Deliberation in Equilibrium: Bargaining in Computationally Complex Problems
We develop a normative theory of interaction-negotiation in particular--among self-interested computationally limited agents where computational actions are game-theoretically tre...
Kate Larson, Tuomas Sandholm
CATS
2007
13 years 9 months ago
Planning with Time Limits in BDI Agent Programming Languages
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...
Lavindra de Silva, Anthony Dekker, James Harland
CSL
2001
Springer
14 years 11 days ago
A Logic for Approximate First-Order Reasoning
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 ï...
Frédéric Koriche
AAAI
2000
13 years 9 months ago
Depth-First Branch-and-Bound versus Local Search: A Case Study
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...
Weixiong Zhang
FGCS
2008
159views more  FGCS 2008»
13 years 8 months ago
Access control management for ubiquitous computing
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...
Hua Wang, Yanchun Zhang, Jinli Cao