Sciweavers

2020 search results - page 169 / 404
» Speeding up Slicing
Sort
View
UAI
1997
15 years 7 months ago
Exploring Parallelism in Learning Belief Networks
It has been shown that a class of probabilistic domain models cannot be learned correctly by several existing algorithms which employ a single-link lookahead search. When a multil...
Tongsheng Chu, Yang Xiang
UAI
1997
15 years 7 months ago
Lexical Access for Speech Understanding using Minimum Message Length Encoding
The Lexical Access Problem consists of determining the intended sequence of words corresponding to an input sequence of phonemes (basic speech sounds) that come from a low-level p...
Ian E. Thomas, Ingrid Zukerman, Jonathan J. Oliver...
AIPS
1994
15 years 7 months ago
Managing Dynamic Temporal Constraint Networks
This paper concerns the specialization of arcconsistency algorithms for constraint satisfaction in the management of quantitative temporal constraint networks. Attention is devote...
Roberto Cervoni, Amedeo Cesta, Angelo Oddi
AIPS
1996
15 years 7 months ago
Computing Parameter Domains as an Aid to Planning
Weshowthat by inferring parametexdomainsof planningoperators,given the definitions of the operators and the initial and goal conditions, we can often speed up the planning process...
Alfonso Gerevini, Lenhart K. Schubert
IJCAI
1989
15 years 7 months ago
Experiences Implementing a Parallel ATMS on a Shared-Memory Multiprocessor
The Assumption-Based Truth Maintenance System (ATMS) is an important tool in A I . So far its wider use has been limited due to the enormous computational resources which it requi...
Edward Rothberg, Anoop Gupta