2252 search results - page 257 / 451 » Lower Bounds for Dynamic Algorithms |
127
Voted
IEAAIE
1994
Springer
15 years 7 months ago
1994
Springer
Genetic Algorithms are heuristic search schemes based on a model of Darwinian evolution. Although not guaranteed to find the optimal solution, genetic algorithms have been shown t...
142
Voted
JCB
2006
15 years 3 months ago
2006
Tree structures are useful for describing and analyzing biological objects and processes. Consequently, there is a need to design metrics and algorithms to compare trees. A natura...
134
Voted
MP
2002
15 years 3 months ago
2002
We design an algorithm, called the fluid synchronization algorithm (FSA), for the job shop scheduling problem with the objective of minimizing the makespan. We round an optimal sol...
152
Voted
TCC
2009
Springer
16 years 4 months ago
2009
Springer
Abstract. Goldreich (ECCC 2000) proposed a candidate one-way function construction which is parameterized by the choice of a small predicate (over d = O(1) variables) and of a bipa...
126
Voted
CIC
2004
15 years 5 months ago
2004
As a key issue in multicast routing with quality of service (QoS) support, constrained minimum Steiner tree (CMST) problem has been a research focus for more than a decade, and ten...