Sciweavers

1941 search results - page 153 / 389
» On the Hardness of Approximate Reasoning
Sort
View
UAI
1998
15 years 7 months ago
The Bayesian Structural EM Algorithm
In recent years there has been a flurry of works on learning Bayesian networks from data. One of the hard problems in this area is how to effectively learn the structure of a beli...
Nir Friedman
DAM
2008
135views more  DAM 2008»
15 years 6 months ago
Edge ranking and searching in partial orders
: We consider a problem of searching an element in a partially ordered set (poset). The goal is to find a search strategy which minimizes the number of comparisons. Ben-Asher, Farc...
Dariusz Dereniowski
AMC
2006
115views more  AMC 2006»
15 years 6 months ago
A memetic algorithm for a vehicle routing problem with backhauls
This paper considers an extension of a vehicle routing problem with backhauls (VRPB). In this problem, a set of costumers are divided in two subsets consisting of linehaul and bac...
Reza Tavakkoli-Moghaddam, A. R. Saremi, M. S. Ziae...
IJNS
2000
80views more  IJNS 2000»
15 years 6 months ago
VLSI Implementation of Neural Networks
Currently, fuzzy controllers are the most popular choice for hardware implementation of complex control surfaces because they are easy to design. Neural controllers are more compl...
Bogdan M. Wilamowski, J. Binfet, M. O. Kaynak
CORR
2011
Springer
188views Education» more  CORR 2011»
15 years 1 months ago
Planar Cycle Covering Graphs
We describe a new variational lower-bound on the minimum energy configuration of a planar binary Markov Random Field (MRF). Our method is based on adding auxiliary nodes to every...
Julian Yarkony, Alexander T. Ihler, Charless C. Fo...