Sciweavers

400 search results - page 31 / 80
» What Makes a Problem GP-Hard
Sort
View
DCOSS
2010
Springer
15 years 7 months ago
Approximate Distributed Kalman Filtering for Cooperative Multi-agent Localization
Abstract. We consider the problem of estimating the locations of mobile agents by fusing the measurements of displacements of the agents as well as relative position measurements b...
Prabir Barooah, Wm. Joshua Russell, João P....
AAAI
2007
15 years 6 months ago
Domain-Independent Construction of Pattern Database Heuristics for Cost-Optimal Planning
Heuristic search is a leading approach to domain-independent planning. For cost-optimal planning, however, existing admissible heuristics are generally too weak to effectively gui...
Patrik Haslum, Adi Botea, Malte Helmert, Blai Bone...
TEC
2010
173views more  TEC 2010»
14 years 11 months ago
Analysis of Computational Time of Simple Estimation of Distribution Algorithms
Estimation of distribution algorithms (EDAs) are widely used in stochastic optimization. Impressive experimental results have been reported in the literature. However, little work ...
Tianshi Chen, Ke Tang, Guoliang Chen, Xin Yao
SIGECOM
2004
ACM
112views ECommerce» more  SIGECOM 2004»
15 years 9 months ago
Self-interested automated mechanism design and implications for optimal combinatorial auctions
Often, an outcome must be chosen on the basis of the preferences reported by a group of agents. The key difficulty is that the agents may report their preferences insincerely to m...
Vincent Conitzer, Tuomas Sandholm
CICLING
2003
Springer
15 years 9 months ago
An Evaluation of a Lexicographer's Workbench Incorporating Word Sense Disambiguation
NLPsystem developers and corpus lexicographers would both bene t from a tool for nding and organizing the distinctive patterns of use of words in texts. Such a tool would be an ass...
Adam Kilgarriff, Rob Koeling