Sciweavers

575 search results - page 12 / 115
» constraints 2011
Sort
View
PROCEDIA
2011
14 years 8 days ago
Exact Closest String as a Constraint Satisfaction Problem
We report the first evaluation of Constraint Satisfaction as a computational framework for solving closest string problems. We show that careful consideration of symbol occurrenc...
Tom Kelsey, Lars Kotthoff
ICASSP
2011
IEEE
14 years 1 months ago
Polar randomized hough transform for lane detection using loose constraints of parallel lines
In this paper, we propose a new methodology for detecting lane markers that exploits the parallel nature of lane boundaries on the road. First, the input image is pre-processed an...
Amol Borkar, Monson Hayes, Mark T. Smith
JOTA
2011
104views more  JOTA 2011»
14 years 4 months ago
Equivalent Conditions for Jacobian Nonsingularity in Linear Symmetric Cone Programming
In this paper we consider the linear symmetric cone programming (SCP). At a KarushKuhn-Tucker (KKT) point of SCP, we present the important equivalent conditions for the nonsingula...
Lingchen Kong, Levent Tunçel, Naihua Xiu
JCO
2011
63views more  JCO 2011»
14 years 10 days ago
Robust multi-sensor scheduling for multi-site surveillance
This paper presents mathematical programming techniques for solving a class of multi-sensor scheduling problems. Robust optimization problems are formulated for both deterministic ...
Nikita Boyko, Timofey Turko, Vladimir Boginski, Da...
JAIR
2011
123views more  JAIR 2011»
14 years 4 months ago
The Complexity of Integer Bound Propagation
Bound propagation is an important Artificial Intelligence technique used in Constraint Programming tools to deal with numerical constraints. It is typically embedded within a sea...
Lucas Bordeaux, George Katsirelos, Nina Narodytska...