Sciweavers

14518 search results - page 267 / 2904
» Two Problems for Sophistication
Sort
View
EMO
2009
Springer
235views Optimization» more  EMO 2009»
16 years 5 days ago
Bi-objective Optimization for the Vehicle Routing Problem with Time Windows: Using Route Similarity to Enhance Performance
Abstract. The Vehicle Routing Problem with Time Windows is a complex combinatorial optimization problem which can be seen as a fusion of two well known sub-problems: the Travelling...
Abel Garcia-Najera, John A. Bullinaria
EUROCRYPT
2003
Springer
15 years 10 months ago
CAPTCHA: Using Hard AI Problems for Security
We introduce captcha, an automated test that humans can pass, but current computer programs can’t pass: any program that has high success over a captcha can be used to solve an u...
Luis von Ahn, Manuel Blum, Nicholas J. Hopper, Joh...
FOCS
1997
IEEE
15 years 9 months ago
The Computational Complexity of Knot and Link Problems
We consider the problem of deciding whether a polygonal knot in 3dimensional Euclidean space is unknotted, capable of being continuously deformed without self-intersection so that...
Joel Hass, J. C. Lagarias, Nicholas Pippenger
WADS
2007
Springer
195views Algorithms» more  WADS 2007»
15 years 11 months ago
Approximation Algorithms for the Sex-Equal Stable Marriage Problem
The stable marriage problem is a classical matching problem introduced by Gale and Shapley. It is known that for any instance, there exists a solution, and there is a polynomial ti...
Kazuo Iwama, Shuichi Miyazaki, Hiroki Yanagisawa
138
Voted
GECCO
2005
Springer
124views Optimization» more  GECCO 2005»
15 years 11 months ago
Generalized benchmark generation for dynamic combinatorial problems
Several general purpose benchmark generators are now available in the literature. They are convenient tools in dynamic continuous optimization as they can produce test instances w...
Abdulnasser Younes, Paul H. Calamai, Otman A. Basi...