Sciweavers

1099 search results - page 103 / 220
» On the Complexity of Computing Evolutionary Trees
Sort
View
CISS
2008
IEEE
15 years 4 months ago
Memory-constrained ML-optimal tree search detection
— In this paper, we propose a memory-constrained tree search (MCTS) algorithm for the detection in multiple-input multiple-output (MIMO) systems. The MCTS algorithm offers a wide...
Yongmei Dai, Zhiyuan Yan
ICRA
2005
IEEE
121views Robotics» more  ICRA 2005»
15 years 3 months ago
Distributed Sampling-Based Roadmap of Trees for Large-Scale Motion Planning
Abstract— High-dimensional problems arising from complex robotic systems test the limits of current motion planners and require the development of efficient distributed motion p...
Erion Plaku, Lydia E. Kavraki
ACG
2009
Springer
15 years 4 months ago
Monte-Carlo Tree Search in Settlers of Catan
Abstract. Games are considered important benchmark tasks of artificial intelligence research. Modern strategic board games can typically be played by three or more people, which m...
Istvan Szita, Guillaume Chaslot, Pieter Spronck
AAAI
2010
14 years 11 months ago
Compilation Complexity of Common Voting Rules
In computational social choice, one important problem is to take the votes of a subelectorate (subset of the voters), and summarize them using a small number of bits. This needs t...
Lirong Xia, Vincent Conitzer
VISSYM
2007
15 years 11 days ago
Model-free Surface Visualization of Vascular Trees
Expressive and efficient visualizations of complex vascular structures are essential for medical applications, such as diagnosis and therapy planning. A variety of techniques has ...
Christian Schumann, Steffen Oeltze, Ragnar Bade, B...