Sciweavers

10148 search results - page 1859 / 2030
» Optimal sub-graphical models
Sort
View
145
Voted
JAIR
2008
98views more  JAIR 2008»
15 years 5 months ago
Loosely Coupled Formulations for Automated Planning: An Integer Programming Perspective
We represent planning as a set of loosely coupled network flow problems, where each network corresponds to one of the state variables in the planning domain. The network nodes cor...
Menkes Hector Louis van den Briel, Thomas Vossen, ...
120
Voted
COR
2007
103views more  COR 2007»
15 years 5 months ago
A reactive GRASP and path relinking for a combined production-distribution problem
An NP-hard production–distribution problem for one product over a multi-period horizon is investigated. The aim is to minimize total cost taking production setups, inventory lev...
Mourad Boudia, Mohamed Aly Ould Louly, Christian P...
156
Voted
IJON
2006
146views more  IJON 2006»
15 years 5 months ago
Feature selection and classification using flexible neural tree
The purpose of this research is to develop effective machine learning or data mining techniques based on flexible neural tree FNT. Based on the pre-defined instruction/operator se...
Yuehui Chen, Ajith Abraham, Bo Yang
134
Voted
CORR
2007
Springer
94views Education» more  CORR 2007»
15 years 5 months ago
Statistical tools to assess the reliability of self-organizing maps
Results of neural network learning are always subject to some variability, due to the sensitivity to initial conditions, to convergence to local minima, and, sometimes more dramat...
Eric de Bodt, Marie Cottrell, Michel Verleysen
139
Voted
CORR
2007
Springer
104views Education» more  CORR 2007»
15 years 5 months ago
Searching for low weight pseudo-codewords
— Belief Propagation (BP) and Linear Programming (LP) decodings of Low Density Parity Check (LDPC) codes are discussed. We summarize results of instanton/pseudo-codeword approach...
Michael Chertkov, Mikhail G. Stepanov
« Prev « First page 1859 / 2030 Last » Next »