Sciweavers

1940 search results - page 293 / 388
» Search with Synonyms: Problems and Solutions
Sort
View
EOR
2008
75views more  EOR 2008»
15 years 6 months ago
Soft car sequencing with colors: Lower bounds and optimality proofs
This paper is a study of the car sequencing problem, when feature spacing constraints are soft and colors of vehicles are taken into account. Both pseudo-polynomial algorithms and ...
Thierry Benoist
CONSTRAINTS
2006
115views more  CONSTRAINTS 2006»
15 years 6 months ago
A Cost-Regular Based Hybrid Column Generation Approach
Abstract. Constraint Programming (CP) offers a rich modeling language of constraints embedding efficient algorithms to handle complex and heterogeneous combinatorial problems. To s...
Sophie Demassey, Gilles Pesant, Louis-Martin Rouss...
AAMAS
2005
Springer
15 years 6 months ago
Efficient Management of Multi-Linked Negotiation Based on a Formalized Model
A Multi-linked negotiation problem occurs when an agent needs to negotiate with multiple other agents about different subjects (tasks, conflicts, or resource requirements), and th...
Xiaoqin Zhang, Victor R. Lesser, Sherief Abdallah
AEI
2005
99views more  AEI 2005»
15 years 6 months ago
Comparison among five evolutionary-based optimization algorithms
Evolutionary algorithms (EAs) are stochastic search methods that mimic the natural biological evolution and/or the social behavior of species. Such algorithms have been developed ...
Emad Elbeltagi, Tarek Hegazy, Donald E. Grierson
IVC
2007
114views more  IVC 2007»
15 years 6 months ago
Evaluation of a convex relaxation to a quadratic assignment matching approach for relational object views
We introduce a convex relaxation approach for the quadratic assignment problem to the field of computer vision. Due to convexity, a favourable property of this approach is the ab...
Christian Schellewald, Stefan Roth, Christoph Schn...