Sciweavers

16082 search results - page 316 / 3217
» Fireworks Algorithm for Optimization
Sort
View
GECCO
2006
Springer
216views Optimization» more  GECCO 2006»
15 years 8 months ago
Comparative analysis of the sailor assignment problem
In this work the performance of several local search and metaheuristic methods is compared to previously reported work using evolutionary algorithms. The results show that while m...
Joseph Vannucci, Deon Garrett, Dipankar Dasgupta
FOCS
2004
IEEE
15 years 8 months ago
Optimal Inapproximability Results for Max-Cut and Other 2-Variable CSPs?
In this paper we show a reduction from the Unique Games problem to the problem of approximating MAX-CUT to within a factor of GW + , for all > 0; here GW .878567 denotes the a...
Subhash Khot, Guy Kindler, Elchanan Mossel, Ryan O...
SWAT
2004
Springer
125views Algorithms» more  SWAT 2004»
15 years 9 months ago
The Optimal Online Algorithms for Minimizing Maximum Lateness
It is well known that the Earliest-Deadline-First (EDF) and the Least-Laxity-First (LLF) algorithms are optimal algorithms for the problem of preemptively scheduling jobs that arr...
Patchrawat Uthaisombut
IPCO
1992
100views Optimization» more  IPCO 1992»
15 years 5 months ago
An Exact Characterization of Greedy Structures
We present exact characterizations of structures on which the greedy algorithm produces optimal solutions. Our characterization, which we call matroid embeddings, complete the par...
Paul Helman, Bernard M. E. Moret, Henry D. Shapiro
99
Voted
JCP
2007
94views more  JCP 2007»
15 years 4 months ago
Low-Complexity Analysis of Repetitive Regularities for Biometric Applications
— Presented in this paper is a joint algorithm optimization and architecture design framework for analysis of repetitive regularities. Two closely coupled algorithm optimization ...
Lei Wang, Niral Patel