Sciweavers

435 search results - page 23 / 87
» Partitioning Search Spaces of a Randomized Search
Sort
View
104
Voted
AIIDE
2008
14 years 12 months ago
Monte-Carlo Tree Search: A New Framework for Game AI
Classic approaches to game AI require either a high quality of domain knowledge, or a long time to generate effective AI behaviour. These two characteristics hamper the goal of es...
Guillaume Chaslot, Sander Bakkes, Istvan Szita, Pi...
ECAI
2008
Springer
14 years 11 months ago
Optimal Coalition Structure Generation In Partition Function Games
1 In multi-agent systems (MAS), coalition formation is typically studied using characteristic function game (CFG) representations, where the performance of any coalition is indepen...
Tomasz P. Michalak, Andrew Dowell, Peter McBurney,...
ICCS
2004
Springer
15 years 3 months ago
The Computational Complexity of Orientation Search in Cryo-Electron Microscopy
Abstract. In this paper we study the problem of determining threedimensional orientations for noisy projections of randomly oriented identical particles. The problem is of central ...
Taneli Mielikäinen, Janne Ravantti, Esko Ukko...
ICIP
2009
IEEE
14 years 7 months ago
A contrario hierarchical image segmentation
Hierarchies are a powerful tool for image segmentation, they produce a multiscale representation which allows to design robust algorithms and can be stored in tree-like structures...
Juan Cardelino, Vicent Caselles, Marcelo Bertalm&i...
ICSM
2006
IEEE
15 years 3 months ago
Allowing Overlapping Boundaries in Source Code using a Search Based Approach to Concept Binding
One approach to supporting program comprehension involves binding concepts to source code. Previously proposed approaches to concept binding have enforced nonoverlapping boundarie...
Nicolas Gold, Mark Harman, Zheng Li, Kiarash Mahda...