5153 search results - page 273 / 1031 » Introduction to Randomized Algorithms |
136
Voted
IFIP
2004
Springer
15 years 9 months ago
2004
Springer
Geometrical place can be sometimes difficult to find by applying mathematical methods. Evolutionary algorithms deal with a population of solutions. This population (initially ran...
97
Voted
CP
2004
Springer
15 years 9 months ago
2004
Springer
The stretch constraint occurs in many rostering problems that arise in the industrial and public service sectors. In this paper we present an efficient algorithm for domain consist...
152
Voted
PPSN
2004
Springer
15 years 9 months ago
2004
Springer
We consider the problem of finding small Golomb rulers, a hard combinatorial optimization task. This problem is here tackled by means of a hybrid evolutionary algorithm (EA). This...
149
Voted
IRREGULAR
1995
Springer
15 years 7 months ago
1995
Springer
In this paper, we review parallel search techniques for approximating the global optimal solution of combinatorial optimization problems. Recent developments on parallel implementa...
134
click to vote
DAM
2008
15 years 3 months ago
2008
This paper presents algorithms to find vertex-critical and edgecritical subgraphs in a given graph G, and demonstrates how these critical subgraphs can be used to determine the ch...