Sciweavers

193 search results - page 25 / 39
» Partial Solutions with Unique Completion
Sort
View
CP
2006
Springer
13 years 11 months ago
Boosting Open CSPs
In previous work, a new approach called Open CSP (OCSP) was defined as a way of integrate information gathering and problem solving. Instead of collecting all variable values befor...
Santiago Macho González, Carlos Ansó...
SIGMOD
1997
ACM
125views Database» more  SIGMOD 1997»
13 years 11 months ago
The Distributed Information Search Component (Disco) and the World Wide Web
The Distributed Information Search COmponent (Disco) is a prototype heterogeneous distributed database that accesses underlying data sources. The Disco prototype currently focuses...
Anthony Tomasic, Rémy Amouroux, Philippe Bo...
ICRA
2008
IEEE
167views Robotics» more  ICRA 2008»
14 years 1 months ago
An approximate algorithm for solving oracular POMDPs
Abstract— We propose a new approximate algorithm, LAJIV (Lookahead J-MDP Information Value), to solve Oracular Partially Observable Markov Decision Problems (OPOMDPs), a special ...
Nicholas Armstrong-Crews, Manuela M. Veloso
ECCV
2002
Springer
14 years 9 months ago
Finding the Largest Unambiguous Component of Stereo Matching
Abstract. Stereo matching is an ill-posed problem for at least two principal reasons: (1) because of the random nature of match similarity measure and (2) because of structural amb...
Radim Sára
ECCV
2000
Springer
14 years 9 months ago
Kruppa Equation Revisited: Its Renormalization and Degeneracy
In this paper, we study general questions about the solvability of the Kruppa equations and show that, in several special cases, the Kruppa equations can be renormalized and becom...
Jana Kosecka, René Vidal, Shankar Sastry, Y...