Sciweavers

13376 search results - page 215 / 2676
» Problem Solving with
Sort
View
CEC
2009
IEEE
15 years 7 months ago
A conflict based SAW method for Constraint Satisfaction Problems
Evolutionary algorithms have employed the SAW (Stepwise Adaptation of Weights) method in order to solve CSPs (Constraint Satisfaction Problems). This method originated in hill-clim...
Rafi Shalom, Mireille Avigal, Ron Unger
105
Voted
FLAIRS
2008
15 years 5 months ago
Tractable Class of a Problem of Goal Satisfaction in Mutual Exclusion Network
In this paper we describe a class of a problem of goal satisfaction in mutual exclusion network that can be solved in polynomial time. This problem provides a common basis for rea...
Pavel Surynek
109
Voted
CP
2003
Springer
15 years 8 months ago
Redundant Modeling for the QuasiGroup Completion Problem
Abstract. The Quasigroup Completion Problem (QCP) is a very challenging benchmark among combinatorial problems, and the focus of much recent interest in the area of constraint prog...
Iván Dotú, Alvaro del Val, Manuel Ce...
ICCV
2007
IEEE
16 years 5 months ago
The 3D-3D Registration Problem Revisited
We describe a new framework for globally solving the 3D-3D registration problem with unknown point correspondences. This problem is significant as it is frequently encountered in ...
Hongdong Li, Richard I. Hartley
125
Voted
EOR
2008
93views more  EOR 2008»
15 years 3 months ago
Approximate methods for convex minimization problems with series-parallel structure
Consider a problem of minimizing a separable, strictly convex, monotone and differentiable function on a convex polyhedron generated by a system of m linear inequalities. The probl...
Adi Ben-Israel, Genrikh Levin, Yuri Levin, Boris R...