Sciweavers

2398 search results - page 45 / 480
» Constraint Programming and Graph Algorithms
Sort
View
101
Voted
CP
2007
Springer
15 years 8 months ago
Solution Counting Algorithms for Constraint-Centered Search Heuristics
Constraints have played a central role in cp because they capture key substructures of a problem and efficiently exploit them to boost inference. This paper intends to do the same ...
Alessandro Zanarini, Gilles Pesant
SODA
2010
ACM
175views Algorithms» more  SODA 2010»
15 years 11 months ago
Fast SDP Algorithms for Constraint Satisfaction Problems
The class of constraint satisfactions problems (CSPs) captures many fundamental combinatorial optimization problems such as Max Cut, Max q-Cut, Unique Games, and Max k-Sat. Recent...
David Steurer
CP
2008
Springer
15 years 4 months ago
Semi-automatic Generation of CHR Solvers for Global Constraints
Constraint programming often involves global constraints, for which various custom filtering algorithms have been published. This work presents a semi-automatic generation of CHR s...
Frank Raiser
COCOON
2007
Springer
15 years 6 months ago
Improved Exact Algorithms for Counting 3- and 4-Colorings
Abstract. We introduce a generic algorithmic technique and apply it on decision and counting versions of graph coloring. Our approach is based on the following idea: either a graph...
Fedor V. Fomin, Serge Gaspers, Saket Saurabh
105
Voted
ICPR
2006
IEEE
16 years 3 months ago
An Efficient Radical-Based Algorithm for Stroke-Order-Free Online Kanji Character Recognition
This paper investigates improvements of an online handwriting stroke-order analysis algorithm -- cube search, based on cube graph stroke-order generation model and dynamic program...
Hiroaki Sakoe, Seiichi Uchida, Wenjie Cai