Sciweavers

1662 search results - page 111 / 333
» The Computational Complexity of Agent Design Problems
Sort
View
ICIA
2007
13 years 11 months ago
Learning Interaction between Conflicting Human Agents and Their Assistants
We build the generic methodology based on machine learning and reasoning to detect the patterns of interaction between conflicting agents, including humans and their assistants. L...
Boris Galitsky, Boris Kovalerchuk
ATAL
2006
Springer
14 years 21 days ago
Deploying a personalized time management agent
We report on our ongoing practical experience in designing, implementing, and deploying PTIME, a personalized agent for time management and meeting scheduling in an open, multi-ag...
Pauline Berry, Bart Peintner, Ken Conley, Melinda ...
STOC
2009
ACM
172views Algorithms» more  STOC 2009»
14 years 9 months ago
Linear time approximation schemes for the Gale-Berlekamp game and related minimization problems
We design a linear time approximation scheme for the GaleBerlekamp Switching Game and generalize it to a wider class of dense fragile minimization problems including the Nearest C...
Marek Karpinski, Warren Schudy
SIGMOD
2002
ACM
198views Database» more  SIGMOD 2002»
14 years 9 months ago
Processing complex aggregate queries over data streams
Recent years have witnessed an increasing interest in designing algorithms for querying and analyzing streaming data (i.e., data that is seen only once in a fixed order) with only...
Alin Dobra, Minos N. Garofalakis, Johannes Gehrke,...
CLIMA
2007
13 years 10 months ago
Plan-Coordination Mechanisms and the Price of Autonomy
Abstract. Task-based planning problems for multi-agent systems require multiple agents to find a joint plan for a constrained set of tasks. Typically, each agent receives a subset...
J. Renze Steenhuisen, Cees Witteveen, Yingqian Zha...