Sciweavers

1361 search results - page 10 / 273
» Spaces of practice
Sort
View
UAI
2008
13 years 11 months ago
Bounding Search Space Size via (Hyper)tree Decompositions
This paper develops a measure for bounding the performance of AND/OR search algorithms for solving a variety of queries over graphical models. We show how drawing a connection to ...
Lars Otten, Rina Dechter
BMCBI
2004
151views more  BMCBI 2004»
13 years 9 months ago
Design, implementation and evaluation of a practical pseudoknot folding algorithm based on thermodynamics
Background: The general problem of RNA secondary structure prediction under the widely used thermodynamic model is known to be NP-complete when the structures considered include a...
Jens Reeder, Robert Giegerich
HICSS
2007
IEEE
115views Biometrics» more  HICSS 2007»
14 years 4 months ago
Leveraging and Limiting Practical Drift in Emergency Response Planning
A knowledge gap exists between what emergency responders know from their direct experience and what emergency planners know from analysis and reflection. The theory of practical d...
Steven R. Haynes, Wendy A. Schafer, John M. Carrol...
DCC
2008
IEEE
14 years 9 months ago
Practical Entropy-Bounded Schemes for O(1)-Range Minimum Queries
The Range Minimum Query (RMQ) Problem is to preprocess an array A of length n in O(n) time such that subsequent on-line queries asking for the position of a minimal element between...
Johannes Fischer, Volker Heun, Horst Martin St&uum...
CORR
2008
Springer
64views Education» more  CORR 2008»
13 years 10 months ago
Implementing general belief function framework with a practical codification for low complexity
In this chapter, we propose a new practical codification of the elements of the Venn diagram in order to easily manipulate the focal elements. In order to reduce the complexity, t...
Arnaud Martin