Sciweavers

8413 search results - page 494 / 1683
» Ordering Problem Subgoals
Sort
View
CP
2003
Springer
16 years 1 days ago
Using the Breakout Algorithm to Identify Hard and Unsolvable Subproblems
Abstract. Local search algorithms have been very successful for solving constraint satisfaction problems (CSP). However, a major weakness has been that local search is unable to de...
Carlos Eisenberg, Boi Faltings
EUROPAR
2003
Springer
16 years 1 days ago
On the Characterization of Distributed Virtual Environment Systems
Abstract. Distributed Virtual Environment systems have experienced a spectacular growth last years. One of the key issues in the design of scalable and costeffective DVE systems is...
Pedro Morillo, Juan M. Orduña, Marcos Fern&...
ICDT
2001
ACM
110views Database» more  ICDT 2001»
15 years 11 months ago
On Answering Queries in the Presence of Limited Access Patterns
In information-integration systems, source relations often have limitations on access patterns to their data; i.e., when one must provide values for certain attributes of a relatio...
Chen Li, Edward Y. Chang
IPPS
2000
IEEE
15 years 11 months ago
A Surface-Based DNA Algorithm for the Expansion of Symbolic Determinants
In the past few years since Adleman’s pioneering work on solving the HPP(Hamiltonian Path Problem) with a DNA-based computer [1], many algorithms have been designed on solving NP...
Zhiquan Frank Qiu, Mi Lu
166
Voted
ICCBR
1997
Springer
15 years 11 months ago
From Troubleshooting to Process Design: Closing the Manufacturing Loop
This paper describes the dual use of a case base for diagnosis and for improving the design of a manufacturing process. In the short term, the case base is used to provide past ex...
Chris J. Price, Ian S. Pegler, M. B. Ratcliffe, A....