Sciweavers

419 search results - page 13 / 84
» First Order Paths in Ordered Trees
Sort
View
DOCENG
2004
ACM
14 years 2 months ago
Supervised learning for the legacy document conversion
We consider the problem of document conversion from the renderingoriented HTML markup into a semantic-oriented XML annotation defined by user-specific DTDs or XML Schema descrip...
Boris Chidlovskii, Jérôme Fuselier
ORL
2010
85views more  ORL 2010»
13 years 7 months ago
Stable routing under the Spanning Tree Protocol
The Spanning Tree Protocol routes traffic on shortest path trees. If some edges fail, the traffic has to be rerouted consequently, setting up alternative trees. In this paper we d...
Fabrizio Grandoni, Gaia Nicosia, Gianpaolo Oriolo,...
AAAI
2007
13 years 11 months ago
Best-First Search for Treewidth
Finding the exact treewidth of a graph is central to many operations in a variety of areas, including probabilistic reasoning and constraint satisfaction. Treewidth can be found b...
P. Alex Dow, Richard E. Korf
ISVLSI
2005
IEEE
115views VLSI» more  ISVLSI 2005»
14 years 2 months ago
Quasi-Exact BDD Minimization Using Relaxed Best-First Search
In this paper we present a new method for quasiexact optimization of BDDs using relaxed ordered best-first search. This general method is applied to BDD minimization. In contrast...
Rüdiger Ebendt, Rolf Drechsler
AAAI
2007
13 years 11 months ago
Best-First AND/OR Search for Graphical Models
The paper presents and evaluates the power of best-first search over AND/OR search spaces in graphical models. The main virtue of the AND/OR representation is its sensitivity to ...
Radu Marinescu 0002, Rina Dechter