559 search results - page 81 / 112 » Fast SDP Algorithms for Constraint Satisfaction Problems |
104
click to vote
CEC
2007
IEEE
15 years 6 months ago
2007
IEEE
This paper studies the problems involved in solving, rating and generating Sudoku puzzles with genetic algorithms (GA). Sudoku is a number puzzle that has recently become a worldwi...
122
click to vote
CODES
1998
IEEE
15 years 7 months ago
1998
IEEE
Timing analysis for checking satisfaction of constraints is a crucial problem in real-time system design. In some current approaches, the delay of software modules is precalculate...
137
Voted
GMP
2006
IEEE
15 years 9 months ago
2006
IEEE
Abstract. We present an efficient and robust algorithm for computing continuous visibility for two- or three-dimensional shapes whose boundaries are NURBS curves or surfaces by li...
126
click to vote
CN
2007
15 years 2 months ago
2007
— We study the problem of integrated topology control and routing in Free Space Optical (FSO) mesh backbone networks. FSO links are high-bandwidth, low interference links that ca...
145
click to vote
AI
2010
Springer
15 years 3 months ago
2010
Springer
The Valued Constraint Satisfaction Problem (VCSP) is a generic optimization problem defined by a network of local cost functions defined over discrete variables. It has applicatio...