4117 search results - page 130 / 824 » On the Satisfiability of Complex Constraints |
136
click to vote
SIAMJO
2008
15 years 6 months ago
2008
This paper presents a parameter-free integer-programming based algorithm for the global resolution of a linear program with linear complementarity constraints (LPCC). The cornersto...
198
click to vote
PRL
2008
15 years 5 months ago
2008
The traditional closest point criterion has been widely used for 3D free form shape matching, object recognition, internet search, computer graphics and medical imaging. However, ...
292
click to vote
PLDI
2009
ACM
16 years 7 months ago
2009
ACM
Reasoning about string variables, in particular program inputs, is an important aspect of many program analyses and testing frameworks. Program inputs invariably arrive as strings...
166
click to vote
ICLP
2003
Springer
15 years 11 months ago
2003
Springer
Abstract The ntcc process calculus is a timed concurrent constraint programming (ccp) model equipped with a first-order linear-temporal logic (LTL) for expressing process specifi...
193
click to vote
GIS
1995
ACM
15 years 10 months ago
1995
ACM
: Usually spatial planning problems involve a large number of decision makers with different backgrounds and interests. The process of Collaborative Spatial Decision Making (CSDM)...