Sciweavers

1984 search results - page 82 / 397
» The colourful feasibility problem
Sort
View
EOR
2008
133views more  EOR 2008»
13 years 10 months ago
Investigating a hybrid simulated annealing and local search algorithm for constrained optimization
Constrained Optimization Problems (COP) often take place in many practical applications such as kinematics, chemical process optimization, power systems and so on. These problems ...
Chandra Sekhar Pedamallu, Linet Özdamar
COMBINATORICA
2006
65views more  COMBINATORICA 2006»
13 years 10 months ago
A Linear Bound On The Diameter Of The Transportation Polytope
We prove that the combinatorial diameter of the skeleton of the polytope of feasible solutions of any m
Graham Brightwell, Jan van den Heuvel, Leen Stougi...
SBACPAD
2003
IEEE
125views Hardware» more  SBACPAD 2003»
14 years 3 months ago
Applying Scheduling by Edge Reversal to Constraint Partitioning
— Scheduling by Edge Reversal (SER) is a fully distributed scheduling mechanism based on the manipulation of acyclic orientations of a graph. This work uses SER to perform constr...
Marluce Rodrigues Pereira, Patrícia Kayser ...
FLAIRS
2003
13 years 11 months ago
Incremental Breakout Algorithm with Variable Ordering
This paper presents the Incremental Breakout Algorithm with Variable Ordering (IncBA). This algorithm belongs to the class of local search algorithms for solving Constraint Satisf...
Carlos Eisenberg, Boi Faltings
JVCIR
2007
125views more  JVCIR 2007»
13 years 10 months ago
Displaying colourimetrically calibrated images on a high dynamic range display
When colourimetrically characterising a high dynamic range display (HDR) built from an LCD panel and an LED backlight one is faced with several problems: the channels may not be c...
Alexa I. Ruppertsberg, Marina Bloj, Francesco Bant...