Sciweavers

2343 search results - page 130 / 469
» Visual-Concept Search Solved
Sort
View
NN
2002
Springer
136views Neural Networks» more  NN 2002»
15 years 4 months ago
Bayesian model search for mixture models based on optimizing variational bounds
When learning a mixture model, we suffer from the local optima and model structure determination problems. In this paper, we present a method for simultaneously solving these prob...
Naonori Ueda, Zoubin Ghahramani
163
Voted
ENTCS
2007
190views more  ENTCS 2007»
15 years 4 months ago
Modelling Multicast QoS Routing by using Best-Tree Search in And-or Graphs and Soft Constraint Logic Programming
We suggest a formal model to represent and solve the multicast routing problem in multicast networks. To attain this, we model the network adapting it to a weighted and-or graph, ...
Stefano Bistarelli, Ugo Montanari, Francesca Rossi...
137
Voted
CP
2009
Springer
15 years 2 months ago
Minimizing the Maximum Number of Open Stacks by Customer Search
We describe a new exact solver for the minimization of open stacks problem (MOSP). By combining nogood recording with a branch and bound strategy based on choosing which customer s...
Geoffrey Chu, Peter J. Stuckey
CORR
2011
Springer
145views Education» more  CORR 2011»
14 years 11 months ago
Global Search Based on Efficient Diagonal Partitions and a set of Lipschitz Constants
In the paper, the global optimization problem of a multidimensional “black-box” function satisfying the Lipschitz condition over a hyperinterval with an unknown Lipschitz const...
Yaroslav D. Sergeyev, Dmitri E. Kvasov
137
Voted
JDCTA
2010
130views more  JDCTA 2010»
14 years 11 months ago
A Search Algorithm for Clusters in a Network or Graph
A novel breadth-first based structural clustering method for graphs is proposed. Clustering is an important task for analyzing complex networks such as biological networks, World ...
Dongming Chen, Jing Wang, Xiaodong Chen, Xiaowei X...