Sciweavers

2981 search results - page 343 / 597
» Answer Set Planning
Sort
View
STOC
1993
ACM
76views Algorithms» more  STOC 1993»
15 years 9 months ago
Piecewise linear paths among convex obstacles
Let B be a set of n arbitrary possibly intersecting convex obstacles in Rd. It is shown that any two points which can be connected by a path avoiding the obstacles can also be c...
Mark de Berg, Jirí Matousek, Otfried Schwar...
VLDB
1990
ACM
116views Database» more  VLDB 1990»
15 years 9 months ago
A Probabilistic Framework for Vague Queries and Imprecise Information in Databases
A probabilistic learning model for vague queries and missing or imprecise information in databases is described. Instead of retrieving only a set of answers, our approach yields a...
Norbert Fuhr
ANTS
2010
Springer
252views Algorithms» more  ANTS 2010»
15 years 9 months ago
On a Problem of Hajdu and Tengely
Abstract. We answer a question asked by Hajdu and Tengely: The only arithmetic progression in coprime integers of the form (a2 , b2 , c2 , d5 ) is (1, 1, 1, 1). For the proof, we ï...
Samir Siksek, Michael Stoll
131
Voted
ECAI
2004
Springer
15 years 8 months ago
Instance-Based Prediction with Guaranteed Confidence
Instance-based learning (IBL) algorithms have proved to be successful in many applications. However, as opposed to standard statistical methods, a prediction in IBL is usually give...
Eyke Hüllermeier
FQAS
2004
Springer
122views Database» more  FQAS 2004»
15 years 8 months ago
Simplification of Integrity Constraints with Aggregates and Arithmetic Built-Ins
In the context of relational as well as deductive databases, correct and efficient integrity checking is a crucial issue, as, without any guarantee of data consistency, the answers...
Davide Martinenghi