Sciweavers

145 search results - page 7 / 29
» On finding approximate optimal paths in weighted regions
Sort
View
UAI
2001
13 years 8 months ago
Maximum Likelihood Bounded Tree-Width Markov Networks
We study the problem of projecting a distribution onto (or finding a maximum likelihood distribution among) Markov networks of bounded tree-width. By casting it as the combinatori...
Nathan Srebro
NN
2000
Springer
192views Neural Networks» more  NN 2000»
13 years 7 months ago
A new algorithm for learning in piecewise-linear neural networks
Piecewise-linear (PWL) neural networks are widely known for their amenability to digital implementation. This paper presents a new algorithm for learning in PWL networks consistin...
Emad Gad, Amir F. Atiya, Samir I. Shaheen, Ayman E...
ESOP
2006
Springer
13 years 11 months ago
Path Optimization in Programs and Its Application to Debugging
We present and solve a path optimization problem on programs. Given a set of program nodes, called critical nodes, we find a shortest path through the program's control flow g...
Akash Lal, Junghee Lim, Marina Polishchuk, Ben Lib...
SWAT
2004
Springer
109views Algorithms» more  SWAT 2004»
14 years 25 days ago
Robust Subgraphs for Trees and Paths
Consider a graph problem which is associated with a parameter, for example, that of finding a longest tour spanning k vertices. The following question is natural: Is there a smal...
Refael Hassin, Danny Segev
JDCTA
2010
148views more  JDCTA 2010»
13 years 2 months ago
Application Research on Optimal Path Based on Genetic Algorithm
At present, China's automobile logistics cost accounts for more than 20% of the production of motor vehicles. Therefore, lowering logistics cost by seeking its best path is a...
Lilin Fan, Huili Meng