Sciweavers

42 search results - page 7 / 9
» Finding trails
Sort
View
WETICE
1998
IEEE
14 years 10 days ago
An Open Architecture for Supporting Collaboration on the Web
The MEMOIR framework supports researchers working with a vast quantity of distributed information, by assisting them in finding both relevant documents and researchers with relate...
David De Roure, Wendy Hall, Siegfried Reich, Aggel...
ECAI
2000
Springer
13 years 11 months ago
Solving Permutation Constraint Satisfaction Problems with Artificial Ants
Abstract. We describe in this paper Ant-P-solver, a generic constraint solver based on the Ant Colony Optimization (ACO) metaheuristic. The ACO metaheuristic takes inspiration on t...
Christine Solnon
CN
1998
69views more  CN 1998»
13 years 7 months ago
An Open Framework for Collaborative Distributed Information Management
The MEMOIR project supports researchers working with a vast quantity of distributed information, by assisting them in finding both relevant documents and researchers with related ...
David De Roure, Wendy Hall, Siegfried Reich, Aggel...
TEC
2002
163views more  TEC 2002»
13 years 7 months ago
Ants can solve constraint satisfaction problems
In this paper, we describe a new incomplete approach for solving constraint satisfaction problems (CSPs) based on the ant colony optimization (ACO) metaheuristic. The idea is to us...
Christine Solnon
GECCO
2007
Springer
241views Optimization» more  GECCO 2007»
14 years 2 months ago
Binary ant algorithm
When facing dynamic optimization problems the goal is no longer to find the extrema, but to track their progression through the space as closely as possible. Over these kind of ov...
Carlos Fernandes, Agostinho C. Rosa, Vitorino Ramo...