Sciweavers

1795 search results - page 219 / 359
» On the Complexity of Circuit Satisfiability
Sort
View
IJPRAI
2000
83views more  IJPRAI 2000»
15 years 6 months ago
Practical Issues in Modeling Large Diagnostic Systems with Multiply Sectioned Bayesian Networks
As Bayesian networks become widely accepted as a normative formalism for diagnosis based on probabilistic knowledge, they are applied to increasingly larger problem domains. These...
Yanping Xiang, Kristian G. Olesen, Finn Verner Jen...
CAD
1998
Springer
15 years 6 months ago
Knot-removal surface fairing using search strategies
Abstract. This paper presents two automatic fairing algorithms for parametric C2 -continuous bi-cubic B-spline surfaces. The fairing method consists of a knot removal and knot rein...
Stefanie Hahmann, Stefan Konz
JALC
2002
97views more  JALC 2002»
15 years 6 months ago
Semiring Frameworks and Algorithms for Shortest-Distance Problems
We define general algebraic frameworks for shortest-distance problems based on the structure of semirings. We give a generic algorithm for finding single-source shortest distances...
Mehryar Mohri
DC
2008
15 years 6 months ago
Contention-free MAC protocols for asynchronous wireless sensor networks
A MAC protocol specifies how nodes in a sensor network access a shared communication channel. Desired properties of a MAC protocol are: it should be contention-free (avoid collisio...
Costas Busch, Malik Magdon-Ismail, Fikret Sivrikay...
LPAR
2010
Springer
15 years 4 months ago
SAT Encoding of Unification in EL
Unification in Description Logics has been proposed as a novel inference service that can, for example, be used to detect redundancies in ontologies. In a recent paper, we have sho...
Franz Baader, Barbara Morawska