Sciweavers

4117 search results - page 228 / 824
» On the Satisfiability of Complex Constraints
Sort
View
CSCLP
2006
Springer
15 years 10 months ago
An Attempt to Dynamically Break Symmetries in the Social Golfers Problem
A number of different satisfaction and optimisation combinatorial problems have recently been approached with constraint programming over the domain of finite sets, for increased d...
Francisco Azevedo
SCA
2007
15 years 9 months ago
Guided time warping for motion editing
Time warping allows users to modify timing without affecting poses. It has many applications in animation systems for motion editing, such as refining motions to meet new timing c...
Eugene Hsu, Marco da Silva, Jovan Popovic
CPAIOR
2008
Springer
15 years 8 months ago
Fitness-Distance Correlation and Solution-Guided Multi-point Constructive Search for CSPs
Solution-Guided Multi-Point Constructive Search (SGMPCS) is a complete, constructive search technique that has been shown to out-perform standard constructive search techniques on ...
Ivan Heckman, J. Christopher Beck
AAAI
1998
15 years 8 months ago
Using Arc Weights to Improve Iterative Repair
One of the surprising findings from the study of CNF satisfiability in the 1990's has been the success of iterative repair techniques, and in particular of weighted iterative...
John Thornton, Abdul Sattar
DKE
2008
104views more  DKE 2008»
15 years 6 months ago
Improving the performance of question answering with semantically equivalent answer patterns
In this paper, we discuss a novel technique based on semantic constraints to improve the performance and portability of a reformulation-based question answering system. First, we ...
Leila Kosseim, Jamileh Yousefi