170 search results - page 21 / 34 » Generalised Epipolar Constraints |
ECAI
2004
Springer
13 years 11 months ago
2004
Springer
Quantified Constraint Satisfaction Problems (QCSPs) are CSPs in which some variables are universally quantified. For each possible value of such variables, we have to find ways to ...
CPAIOR
2005
Springer
14 years 1 months ago
2005
Springer
Abstract. This paper introduces a problem called the temporal knapsack problem, presents several algorithms for solving it, and compares their performance. The temporal knapsack pr...
ISAAC
2003
Springer
14 years 25 days ago
2003
Springer
We study the problem of allocating students to projects, where both students and lecturers have preferences over projects, and both projects and lecturers have capacities. In this...
ERSHOV
1999
Springer
13 years 12 months ago
1999
Springer
We extend positive supercompilation to handle negative as well as positive information. This is done by instrumenting the underlying unfold rules with a small rewrite system that h...
SYNTHESE
2008
13 years 7 months ago
2008
Objective Bayesian probability is often defined over rather simple domains, e.g., finite event spaces or propositional languages. This paper investigates the extension of objectiv...