1984 search results - page 138 / 397 » The colourful feasibility problem |
ICRA
1993
IEEE
14 years 2 months ago
1993
IEEE
This paper investigates the problem of "formclosure"for three-fingered grasps of polygonal objects under various combinations of contact models at the contact points. We...
CEC
2007
IEEE
14 years 2 months ago
2007
IEEE
Existing niching techniques commonly use the Euclidean distance metric in the decision space for the classification of feasible solutions to the niches under formation. This approa...
FSKD
2006
Springer
14 years 1 months ago
2006
Springer
We regard answer extraction of Question Answering (QA) system as a classification problem, classifying answer candidate sentences into positive or negative. To confirm the feasibil...
LPAR
2000
Springer
14 years 1 months ago
2000
Springer
In this paper, we determine the complexity of propositional theory curbing. Theory Curbing is a nonmonotonic technique of common sense reasoning that is based on model minimality b...
ECAI
2008
Springer
13 years 12 months ago
2008
Springer
We provide a characterization of Horn cores for formulas in conjunctive normal form (CNF) and, based on it, a novel algorithm for computing Horn cores of disjunctions of Horn CNFs ...