Sciweavers

1047 search results - page 122 / 210
» Searching Without a Heuristic: Efficient Use of Abstraction
Sort
View
PLILP
1993
Springer
14 years 2 days ago
Narrowing Approximations as an Optimization for Equational Logic Programs
Abstract. Solving equations in equational theories is a relevant programming paradigm which integrates logic and equational programming into one unified framework. Efficient metho...
María Alpuente, Moreno Falaschi, Marí...
CORR
2002
Springer
81views Education» more  CORR 2002»
13 years 7 months ago
Value withdrawal explanations: a theoretical tool for programming environments
Abstract. Constraint logic programming combines declarativity and efficiency thanks to constraint solvers implemented for specific domains. Value withdrawal explanations have been ...
Willy Lesaint
EDBT
2008
ACM
161views Database» more  EDBT 2008»
14 years 8 months ago
Load distribution of analytical query workloads for database cluster architectures
Enterprises may have multiple database systems spread across the organization for redundancy or for serving different applications. In such systems, query workloads can be distrib...
Thomas Phan, Wen-Syan Li
ATAL
2003
Springer
14 years 1 months ago
Trade of a problem-solving task
This paper focuses on a task allocation problem, particularly in cases where the task is to find a solution to a search problem or a constraint satisfaction problem. If the searc...
Shigeo Matsubara
CDC
2010
IEEE
170views Control Systems» more  CDC 2010»
13 years 3 months ago
Motion planning with hybrid dynamics and temporal goals
In this paper, we consider the problem of motion planning for mobile robots with nonlinear hybrid dynamics, and high-level temporal goals. We use a multi-layered synergistic framew...
Amit Bhatia, Lydia E. Kavraki, Moshe Y. Vardi