Sciweavers

5055 search results - page 918 / 1011
» Relative Timing
Sort
View
114
Voted
AAMAS
2005
Springer
15 years 8 months ago
Towards Adaptive Role Selection for Behavior-Based Agents
This paper presents a model for adaptive agents. The model describes the behavior of an agent as a graph of roles, in short a behavior graph. Links between roles provide conditions...
Danny Weyns, Kurt Schelfthout, Tom Holvoet, Olivie...
142
Voted
ATAL
2005
Springer
15 years 8 months ago
A multiagent system manages collaboration in emergent processes
Emergent processes are non-routine, collaborative business processes whose execution is guided by the knowledge that emerges during a process instance. In so far as the process go...
John K. Debenham
148
Voted
ATAL
2005
Springer
15 years 8 months ago
Extending the recognition-primed decision model to support human-agent collaboration
There has been much research investigating team cognition, naturalistic decision making, and collaborative technology as it relates to real world, complex domains of practice. How...
Xiaocong Fan, Shuang Sun, Michael D. McNeese, John...
ATAL
2005
Springer
15 years 8 months ago
Multi-agent decision support via user-modeling
Decision-support requires the gathering and presentation of information, but is subject to many kinds of resource restrictions (e.g. cost, length, time). Individual users differ n...
Terrence Harvey, Keith S. Decker, Sandra Carberry
COCO
2005
Springer
123views Algorithms» more  COCO 2005»
15 years 8 months ago
If NP Languages are Hard on the Worst-Case Then It is Easy to Find Their Hard Instances
We prove that if NP ⊆ BPP, i.e., if SAT is worst-case hard, then for every probabilistic polynomial-time algorithm trying to decide SAT, there exists some polynomially samplable ...
Dan Gutfreund, Ronen Shaltiel, Amnon Ta-Shma