1381 search results - page 59 / 277 » Computational Complexity of Constraint Satisfaction |
173
click to vote
SAC
2006
ACM
15 years 3 months ago
2006
ACM
Interactive configuration guides a user searching through a large combinatorial space of solutions to a system of constraints. We investigate a class of very expressive underlying...
140
Voted
CP
2007
Springer
15 years 8 months ago
2007
Springer
Abstract. Computing the minimal network (or minimal CSP) representation of a given set of constraints over the Point Algebra (PA) is a fundamental reasoning problem. In this paper ...
123
Voted
ICRA
2010
IEEE
15 years 2 months ago
2010
IEEE
— We present a novel Weighted Barrier Function (WBF) method of efficiently computing optimal grasping force distributions for multifingered hands. Second-order conic friction c...
137
click to vote
TDSC
2008
15 years 3 months ago
2008
Trustworthy computing modules like secure coprocessors (ScP) are already in extensive use today, albeit limited predominantly to scenarios where constraints on cost is not a seriou...
110
click to vote
CONSTRAINTS
2007
15 years 4 months ago
2007
SAT is probably one of the most-studied constraint satisfaction problems. In this paper, a new hybrid technique based on local search is introduced in order to approximate and ext...