Sciweavers

4171 search results - page 589 / 835
» Choice numbers of graphs
Sort
View
IJCAI
1997
15 years 8 months ago
On the Efficient Classification of Data Structures by Neural Networks
Marco Gori Dipartimento di Ingegneria deU'Informazione Universita di Siena Via Roma 56 53100 Siena, Italy Alessandro Sperduti Dipartimento di Informatica Universita di Pisa C...
Paolo Frasconi, Marco Gori, Alessandro Sperduti
UAI
2000
15 years 8 months ago
Tractable Bayesian Learning of Tree Belief Networks
In this paper we present decomposable priors, a family of priors over structure and parameters of tree belief nets for which Bayesian learning with complete observations is tracta...
Marina Meila, Tommi Jaakkola
ICGA
1993
296views Optimization» more  ICGA 1993»
15 years 8 months ago
A Genetic Algorithm Applied to the Maximum Flow Problem
A genetic algorithms is applied to find a maximum flow from the source to sink in a weighted directed graph, where the weight associated with each edge represents its flow capacit...
Toshinori Munakata, David J. Hashier
ADHOCNOW
2008
Springer
15 years 7 months ago
Optimal Gathering Algorithms in Multi-hop Radio Tree-Networks ith Interferences
We study the problem of gathering information from the nodes of a multi-hop radio network into a pre-defined destination node under the interference constraints. In such a network...
Jean-Claude Bermond, Min-Li Yu
ACTA
2007
92views more  ACTA 2007»
15 years 6 months ago
Solving #SAT using vertex covers
Abstract We propose an exact algorithm for counting the models of propositional formulas in conjunctive normal form (CNF). Our algorithm is based on the detection of strong backdoo...
Naomi Nishimura, Prabhakar Ragde, Stefan Szeider