Sciweavers

3446 search results - page 536 / 690
» A Reasoning Algorithm for pD*
Sort
View
ATAL
2004
Springer
15 years 9 months ago
Learning User Preferences for Wireless Services Provisioning
The problem of interest is how to dynamically allocate wireless access services in a competitive market which implements a take-it-or-leave-it allocation mechanism. In this paper ...
George Lee, Steven Bauer, Peyman Faratin, John Wro...
ATAL
2004
Springer
15 years 9 months ago
Universality in Multi-Agent Systems
Much research in multi-agent systems reflects the field’s origins in classical artificial intelligence, showing how various refinements to the internal reasoning of individual a...
H. Van Dyke Parunak, Sven Brueckner, Robert Savit
ATAL
2004
Springer
15 years 9 months ago
An Intent-Driven Planner for Multi-Agent Story Generation
The ability to generate narrative is of importance to computer systems that wish to use story effectively for entertainment, training, or education. We identify two properties of ...
Mark O. Riedl, R. Michael Young
CINQ
2004
Springer
131views Database» more  CINQ 2004»
15 years 9 months ago
Model-Independent Bounding of the Supports of Boolean Formulae in Binary Data
Abstract. Data mining algorithms such as the Apriori method for finding frequent sets in sparse binary data can be used for efficient computation of a large number of summaries fr...
Artur Bykowski, Jouni K. Seppänen, Jaakko Hol...
COCO
2004
Springer
106views Algorithms» more  COCO 2004»
15 years 9 months ago
Separating Complexity Classes Using Structural Properties
We study the robustness of complete sets for various complexity classes. A complete set A is robust if for any f(n)-dense set S ∈ P, A−S is still complete, where f(n) ranges f...
Harry Buhrman, Leen Torenvliet