Sciweavers

2918 search results - page 582 / 584
» Distributed Troubleshooting Agents
Sort
View
CORR
2010
Springer
116views Education» more  CORR 2010»
13 years 7 months ago
Where are the hard manipulation problems?
One possible escape from the Gibbard-Satterthwaite theorem is computational complexity. For example, it is NP-hard to compute if the STV rule can be manipulated. However, there is...
Toby Walsh
BMCBI
2007
177views more  BMCBI 2007»
13 years 7 months ago
Biowep: a workflow enactment portal for bioinformatics applications
Background: The huge amount of biological information, its distribution over the Internet and the heterogeneity of available software tools makes the adoption of new data integrat...
Paolo Romano 0001, Ezio Bartocci, Guglielmo Bertol...
NN
2006
Springer
232views Neural Networks» more  NN 2006»
13 years 7 months ago
A probabilistic model of gaze imitation and shared attention
An important component of language acquisition and cognitive learning is gaze imitation. Infants as young as one year of age can follow the gaze of an adult to determine the objec...
Matthew W. Hoffman, David B. Grimes, Aaron P. Shon...
JETAI
2007
131views more  JETAI 2007»
13 years 7 months ago
A computational architecture for heterogeneous reasoning
Reasoning, problem solving, indeed the general process of acquiring knowledge, is not an isolated, homogenous affair involving a one agent using a single form of representation, b...
Dave Barker-Plummer, John Etchemendy
AI
2002
Springer
13 years 7 months ago
Algorithm for optimal winner determination in combinatorial auctions
Combinatorial auctions, that is, auctions where bidders can bid on combinations of items, tend to lead to more efficient allocations than traditional auction mechanisms in multi-i...
Tuomas Sandholm