Sciweavers

18209 search results - page 3531 / 3642
» Some Remarks on the Paper
Sort
View
IOR
2006
177views more  IOR 2006»
15 years 6 months ago
Combinatorial Benders' Cuts for Mixed-Integer Linear Programming
Mixed-Integer Programs (MIP's) involving logical implications modelled through big-M coefficients, are notoriously among the hardest to solve. In this paper we propose and an...
Gianni Codato, Matteo Fischetti
CORR
2007
Springer
167views Education» more  CORR 2007»
15 years 6 months ago
Approximation Algorithms for Orienteering with Time Windows
Orienteering is the following optimization problem: given an edge-weighted graph (directed or undirected), two nodes s, t and a time limit T, find an s-t walk of total length at ...
Chandra Chekuri, Nitish Korula
ISI
2006
Springer
15 years 6 months ago
An Embedded Bayesian Network Hidden Markov Model for Digital Forensics
In the paper we combine a Bayesian Network model for encoding forensic evidence during a given time interval with a Hidden Markov Model (EBN-HMM) for tracking and predicting the de...
Olivier Y. de Vel, Nianjun Liu, Terry Caelli, Tib&...
CPHYSICS
2007
222views more  CPHYSICS 2007»
15 years 6 months ago
JADAMILU: a software code for computing selected eigenvalues of large sparse symmetric matrices
A new software code for computing selected eigenvalues and associated eigenvectors of a real symmetric matrix is described. The eigenvalues are either the smallest or those closes...
Matthias Bollhöfer, Yvan Notay
JMLR
2008
116views more  JMLR 2008»
15 years 6 months ago
Support Vector Machinery for Infinite Ensemble Learning
Ensemble learning algorithms such as boosting can achieve better performance by averaging over the predictions of some base hypotheses. Nevertheless, most existing algorithms are ...
Hsuan-Tien Lin, Ling Li
« Prev « First page 3531 / 3642 Last » Next »