128 search results - page 5 / 26 » Parallel Simulated Annealing Algorithm for Graph Coloring Pr... |
FOCS
1993
IEEE
13 years 12 months ago
1993
IEEE
We resolve in the a rmative a question of Boppana and Bui: whether simulated annealing can, with high probability and in polynomial time, nd the optimal bisection of a random grap...
AACC
2004
Springer
14 years 1 months ago
2004
Springer
Searching on the Internet has grown in importance over the last few years, as huge amount of information is invariably accumulated on the Web. The problem involves locating the des...
ICIP
2009
IEEE
14 years 8 months ago
2009
IEEE
We propose a new fibre tracking algorithm for cardiac DTMRI that parts with the locally "greedy" paradigm intrinsic to conventional tracking algorithms. We formulate the...
ANOR
2002
13 years 7 months ago
2002
We present a Tabu Search (TS) method that employs a simple version of ejection chains for coloring graphs. The procedure is tested on a set of benchmark problems. Empirical result...
GECCO
2009
Springer
14 years 10 days ago
2009
Springer
Automatic design of software architecture by use of genetic algorithms has already been shown to be feasible. A natural problem is to augment – if not replace – genetic algori...