37 search results - page 4 / 8 » Exact Closest String as a Constraint Satisfaction Problem |
CONSTRAINTS
1998
13 years 5 months ago
1998
Abstract. Temporal Constraint Satisfaction is an information technology useful for representing and answering queries about the times of events and the temporal relations between t...
ICALP
2010
Springer
13 years 10 months ago
2010
Springer
Min Ones Constraint Satisfaction Problems, i.e., the task of finding a satisfying assignment with at most k true variables (Min Ones SAT(Γ)), can express a number of interesting ...
CORR
2006
Springer
13 years 5 months ago
2006
Springer
In the maximum constraint satisfaction problem (Max CSP), one is given a finite collection of (possibly weighted) constraints on overlapping sets of variables, and the goal is to ...
GIS
2004
ACM
14 years 6 months ago
2004
ACM
The advances in wireless communication and decreasing costs of mobile devices have enabled users to access desired information at any time. Coupled with positioning technologies l...
APPROX
2005
Springer
13 years 11 months ago
2005
Springer
We study the approximability of 1-in-kSAT, the variant of Max kSAT where a clause is deemed satisfied when precisely one of its literals is satisfied. We also investigate differ...