128 search results - page 17 / 26 » Parallel Simulated Annealing Algorithm for Graph Coloring Pr... |
150
click to vote
SIAMIS
2010
14 years 8 months ago
2010
Simulated annealing (SA) and deterministic continuation are well-known generic approaches to global optimization. Deterministic continuation is computationally attractive but produ...
127
click to vote
INFOCOM
2005
IEEE
15 years 7 months ago
2005
IEEE
— We consider the problem of link scheduling in a sensor network employing a TDMA MAC protocol. Our link scheduling algorithm involves two phases. In the first phase, we assign ...
121
click to vote
ICCS
1993
Springer
15 years 6 months ago
1993
Springer
Adaptive predictive search (APS), is a learning system framework, which given little initial domain knowledge, increases its decision-making abilities in complex problems domains....
121
click to vote
SPAA
2003
ACM
15 years 7 months ago
2003
ACM
In the minimum path coloring problem, we are given a graph and a set of pairs of vertices of the graph and we are asked to connect the pairs by colored paths in such a way that pa...
GECCO
2004
Springer
15 years 7 months ago
2004
Springer
Abstract. This work compares different metaheuristics techniques applied to an important problem in natural language: tagging. Tagging amounts to assigning to each word in a text ...