Sciweavers

1964 search results - page 89 / 393
» Partitioning Based Algorithms for Some Colouring Problems
Sort
View
ICML
1995
IEEE
14 years 8 months ago
Ant-Q: A Reinforcement Learning Approach to the Traveling Salesman Problem
In this paper we introduce Ant-Q, a family of algorithms which present many similarities with Q-learning (Watkins, 1989), and which we apply to the solution of symmetric and asymm...
Luca Maria Gambardella, Marco Dorigo
CP
2011
Springer
12 years 7 months ago
Pseudo-Tree-Based Incomplete Algorithm for Distributed Constraint Optimization with Quality Bounds
A Distributed Constraint Optimization Problem (DCOP) is a fundamental problem that can formalize various applications related to multi-agent cooperation. Since it is NP-hard, consi...
Tenda Okimoto, Yongjoon Joe, Atsushi Iwasaki, Mako...
ICCV
2007
IEEE
14 years 9 months ago
Limits of Learning-Based Superresolution Algorithms
Learning-based superresolution (SR) are popular SR techniques that use application dependent priors to infer the missing details in low resolution images (LRIs). However, their pe...
Zhouchen Lin, Junfeng He, Xiaoou Tang, Chi-Keung T...
CEC
2010
IEEE
13 years 9 months ago
Evolutionary multi-objective optimization algorithms with probabilistic representation based on pheromone trails
Abstract-- Recently, the research on quantum-inspired evolutionary algorithms (QEA) has attracted some attention in the area of evolutionary computation. QEA use a probabilistic re...
Hui Li, Dario Landa Silva, Xavier Gandibleux
COMPGEOM
1996
ACM
14 years 10 hour ago
Developing a Practical Projection-Based Parallel Delaunay Algorithm
In this paper we are concerned with developing a practical parallel algorithm for Delaunay triangulation that works well on general distributions, particularly those that arise in...
Guy E. Blelloch, Gary L. Miller, Dafna Talmor