Sciweavers

40 search results - page 7 / 8
» Variable space search for graph coloring
Sort
View
CEC
2010
IEEE
13 years 6 months ago
The differential Ant-Stigmergy Algorithm for large-scale global optimization
— Ant-colony optimization (ACO) is a popular swarm intelligence metaheuristic scheme that can be applied to almost any optimization problem. In this paper, we address a performan...
Peter Korosec, Katerina Taskova, Jurij Silc
VIS
2007
IEEE
128views Visualization» more  VIS 2007»
14 years 7 months ago
Modeling Perceptual Dominance Among Visual Cues in Multilayered Icon-based Scientific Visualizations
ization method is an abstract function that transforms a scientific dataset into a visual representation to facilitate data exploration. In turn, a visualization display is the vis...
Daniel Acevedo, Jian Chen, David H. Laidlaw
SAT
2007
Springer
181views Hardware» more  SAT 2007»
13 years 12 months ago
Breaking Symmetries in SAT Matrix Models
Abstract. Symmetry occurs naturally in many computational problems. The use of symmetry breaking techniques for solving search problems reduces the search space and therefore is ex...
Inês Lynce, João P. Marques Silva
CEC
2011
IEEE
12 years 5 months ago
Cost-benefit analysis of using heuristics in ACGP
—Constrained Genetic Programming (CGP) is a method of searching the Genetic Programming search space non-uniformly, giving preferences to certain subspaces according to some heur...
John W. Aleshunas, Cezary Z. Janikow
AI
2011
Springer
13 years 24 days ago
Bounded approximate decentralised coordination via the max-sum algorithm
In this paper we propose a novel approach to decentralised coordination, that is able to efficiently compute solutions with a guaranteed approximation ratio. Our approach is base...
Alex Rogers, Alessandro Farinelli, Ruben Stranders...