Sciweavers

14548 search results - page 333 / 2910
» The Optimal Path-Matching Problem
Sort
View
GECCO
2003
Springer
148views Optimization» more  GECCO 2003»
15 years 12 months ago
A Hybrid Immune Algorithm with Information Gain for the Graph Coloring Problem
We present a new Immune Algorithm that incorporates a simple local search procedure to improve the overall performances to tackle the graph coloring problem instances. We character...
Vincenzo Cutello, Giuseppe Nicosia, Mario Pavone
CCCG
2007
15 years 8 months ago
The Slider-Pinning Problem
A Laman mechanism is a flexible planar bar-and-joint framework with m ≤ 2n−3 edges and exactly k = 2n− m degrees of freedom. The slider-pinning problem is to eliminate all ...
Audrey Lee, Ileana Streinu, Louis Theran
WAOA
2005
Springer
104views Algorithms» more  WAOA 2005»
16 years 4 days ago
The Online Target Date Assignment Problem
Abstract. Many online problems encountered in real-life involve a twostage decision process: upon arrival of a new request, an irrevocable firststage decision (the assignment of a...
Stefan Heinz, Sven Oliver Krumke, Nicole Megow, J&...
AMC
2006
107views more  AMC 2006»
15 years 6 months ago
Linear bilevel programming with upper level constraints depending on the lower level solution
Focus in the paper is on the definition of linear bilevel programming problems, the existence of optimal solutions and necessary as well as sufficient optimality conditions. In th...
Ayalew Getachew Mersha, Stephan Dempe
273
Voted
ICALP
2009
Springer
16 years 7 months ago
Correlation Clustering Revisited: The "True" Cost of Error Minimization Problems
Correlation Clustering was defined by Bansal, Blum, and Chawla as the problem of clustering a set of elements based on a possibly inconsistent binary similarity function between e...
Nir Ailon, Edo Liberty