Sciweavers

1071 search results - page 81 / 215
» Protein structure search and local structure characterizatio...
Sort
View
AAAI
2000
13 years 9 months ago
Depth-First Branch-and-Bound versus Local Search: A Case Study
Depth-first branch-and-bound (DFBnB) is a complete algorithm that is typically used to find optimal solutions of difficult combinatorial optimization problems. It can also be adap...
Weixiong Zhang
WSDM
2009
ACM
188views Data Mining» more  WSDM 2009»
14 years 2 months ago
Is Wikipedia link structure different?
In this paper, we investigate the difference between Wikipedia and Web link structure with respect to their value as indicators of the relevance of a page for a given topic of re...
Jaap Kamps, Marijn Koolen
SIAMJO
2010
137views more  SIAMJO 2010»
13 years 6 months ago
Global Convergence of a New Hybrid Gauss--Newton Structured BFGS Method for Nonlinear Least Squares Problems
In this paper, we propose a hybrid Gauss-Newton structured BFGS method with a new update formula and a new switch criterion for the iterative matrix to solve nonlinear least square...
Weijun Zhou, Xiaojun Chen
IJAR
2007
130views more  IJAR 2007»
13 years 7 months ago
Bayesian network learning algorithms using structural restrictions
The use of several types of structural restrictions within algorithms for learning Bayesian networks is considered. These restrictions may codify expert knowledge in a given domai...
Luis M. de Campos, Javier Gomez Castellano
IJAR
2010
113views more  IJAR 2010»
13 years 6 months ago
A geometric view on learning Bayesian network structures
We recall the basic idea of an algebraic approach to learning Bayesian network (BN) structures, namely to represent every BN structure by a certain (uniquely determined) vector, c...
Milan Studený, Jirí Vomlel, Raymond ...