Sciweavers

150 search results - page 8 / 30
» Solving Small TSPs with Constraints
Sort
View
GECCO
2005
Springer
110views Optimization» more  GECCO 2005»
14 years 1 months ago
A genetic algorithm encoding for a class of cardinality constraints
A genetic algorithm encoding is proposed which is able to automatically satisfy a class of important cardinality constraints where the set of distinct values of the design variabl...
Helio J. C. Barbosa, Afonso C. C. Lemonge
CVPR
2001
IEEE
14 years 9 months ago
Convex and Non-convex Illuminant Constraints for Dichromatic Colour Constancy
The dichromatic reflectance model introduced by Shafer [16] predicts that the colour signals of most materials fall on a plane spanned by a vector due to the material and a vector...
Graham D. Finlayson, Gerald Schaefer
ECAI
2004
Springer
14 years 28 days ago
Robust Solutions for Constraint Satisfaction and Optimization
Super solutions are a mechanism to provide robustness to constraint programs [10]. They are solutions in which, if a small number of variables lose their values, we are guaranteed ...
Emmanuel Hebrard, Brahim Hnich, Toby Walsh
AAAI
2008
13 years 10 months ago
An Efficient Motion Planning Algorithm for Stochastic Dynamic Systems with Constraints on Probability of Failure
When controlling dynamic systems, such as mobile robots in uncertain environments, there is a trade off between risk and reward. For example, a race car can turn a corner faster b...
Masahiro Ono, Brian C. Williams
COCO
2011
Springer
216views Algorithms» more  COCO 2011»
12 years 7 months ago
Linear Systems over Finite Abelian Groups
We consider a system of linear constraints over any finite Abelian group G of the following form: i(x1, . . . , xn) ≡ i,1x1 + · · · + i,nxn ∈ Ai for i = 1, . . . , t and e...
Arkadev Chattopadhyay, Shachar Lovett