Sciweavers

10608 search results - page 479 / 2122
» Complexity of O'Hara's Algorithm
Sort
View
ANOR
2011
117views more  ANOR 2011»
14 years 8 months ago
A simple and effective algorithm for the MaxMin diversity problem
The challenge of maximizing the diversity of a collection of points arises in a variety of settings, including the setting of search methods for hard optimization problems. One ver...
Daniel Cosmin Porumbel, Jin-Kao Hao, Fred Glover
154
Voted
HM
2007
Springer
135views Optimization» more  HM 2007»
15 years 11 months ago
Hybrid Local Search Techniques for the Resource-Constrained Project Scheduling Problem
This paper proposes a local search algorithm that makes use of a complex neighborhood relation based on a hybridization with a constructive heuristics for the classical resource-co...
Igor Pesek, Andrea Schaerf, Janez Zerovnik
126
Voted
EVOW
2005
Springer
15 years 10 months ago
Self-Adapting Evolutionary Parameters: Encoding Aspects for Combinatorial Optimization Problems
Abstract. Evolutionary algorithms are powerful tools in search and optimization tasks with several applications in complex engineering problems. However, setting all associated par...
Marcos H. Maruo, Heitor S. Lopes, Myriam Regattier...
SIGGRAPH
1997
ACM
15 years 9 months ago
Interactive multiresolution mesh editing
We describe a multiresolution representation for meshes based on subdivision, which is a natural extension of the existing patch-based surface representations. Combining subdivisi...
Denis Zorin, Peter Schröder, Wim Sweldens
IPL
2007
69views more  IPL 2007»
15 years 4 months ago
On the fixed-parameter tractability of the equivalence test of monotone normal forms
We consider the problem Monet—given two monotone formulas ϕ in DNF and ψ in CNF, decide whether they are equivalent. While Monet is probably not coNPhard, it is a long standin...
Matthias Hagen