Sciweavers

4926 search results - page 268 / 986
» Two Graph Algorithms On an Associative Computing Model
Sort
View
PPOPP
2012
ACM
14 years 1 months ago
Internally deterministic parallel algorithms can be fast
The virtues of deterministic parallelism have been argued for decades and many forms of deterministic parallelism have been described and analyzed. Here we are concerned with one ...
Guy E. Blelloch, Jeremy T. Fineman, Phillip B. Gib...
AAAI
2010
15 years 4 months ago
Latent Class Models for Algorithm Portfolio Methods
Different solvers for computationally difficult problems such as satisfiability (SAT) perform best on different instances. Algorithm portfolios exploit this phenomenon by predicti...
Bryan Silverthorn, Risto Miikkulainen
ERSHOV
1999
Springer
15 years 10 months ago
Multi-agent Optimal Path Planning for Mobile Robots in Environment with Obstacles
Abstract. The paper describes a problem of multi-agent path planning in environment with obstacles. Novel approach to multi-agent optimal path planning, using graph representation ...
Fedor A. Kolushev, Alexander A. Bogdanov
CIVR
2008
Springer
279views Image Analysis» more  CIVR 2008»
15 years 8 months ago
Semi-supervised learning of object categories from paired local features
This paper presents a semi-supervised learning (SSL) approach to find similarities of images using statistics of local matches. SSL algorithms are well known for leveraging a larg...
Wen Wu, Jie Yang
PPSN
2004
Springer
15 years 11 months ago
Improving Evolutionary Algorithms with Multi-representation Island Models
Abstract. We present an island model that uses different representations in each island. The model transforms individuals from one representation to another during migrations. We ...
Zbigniew Skolicki, Kenneth A. De Jong