8413 search results - page 226 / 1683 » Ordering Problem Subgoals |
131
click to vote
AI
2008
Springer
15 years 27 days ago
2008
Springer
We make a number of contributions to the study of the Quantified Constraint Satisfaction Problem (QCSP). The QCSP is an extension of the constraint satisfaction problem that can b...
107
click to vote
AMAI
1999
Springer
15 years 13 days ago
1999
Springer
Temporal Constraint Satisfaction Problems (TCSP) is a well known approach for representing and processing temporal knowledge. Important properties of the knowledge can be inferred...
128
Voted
OIR
2007
15 years 8 days ago
2007
Purpose – The purpose of this paper is to evaluate Help features in digital libraries and identify problems related to their design. Design/methodology/approach – This study s...
128
click to vote
SAGT
2010
Springer
14 years 11 months ago
2010
Springer
The PPAD-completeness of Nash equilibrium computation is taken as evidence that the problem is computationally hard in the worst case. This evidence is necessarily rather weak, in ...
238
click to vote
PADL
2009
Springer
16 years 1 months ago
2009
Springer
Abstract. PADS is a declarative language used to describe the syntax and semantic properties of ad hoc data sources such as financial transactions, server logs and scientific data ...