Sciweavers

129 search results - page 17 / 26
» arc 2010
Sort
View
APIN
2010
108views more  APIN 2010»
13 years 10 months ago
A low variance error boosting algorithm
Abstract. This paper introduces a robust variant of AdaBoost, cwAdaBoost, that uses weight perturbation to reduce variance error, and is particularly effective when dealing with da...
Ching-Wei Wang, Andrew Hunter
COR
2010
152views more  COR 2010»
13 years 10 months ago
Variable neighborhood search for the dial-a-ride problem
In dial-a-ride problems passengers have to be transported between pre-specified pickup and delivery locations under user inconvenience considerations. The problem variant consider...
Sophie N. Parragh, Karl F. Doerner, Richard F. Har...
CPC
2010
116views more  CPC 2010»
13 years 7 months ago
A Separator Theorem for String Graphs and its Applications
A string graph is the intersection graph of a collection of continuous arcs in the plane. It is shown that any string graph with m edges can be separated into two parts of roughly...
Jacob Fox, János Pach
INFORMATICALT
2010
116views more  INFORMATICALT 2010»
13 years 7 months ago
A Dynamic Network Interdiction Problem
We present a novel dynamic network interdiction model that accounts for interactions between an interdictor deploying resources on arcs in a digraph and an evader traversing the ne...
Brian J. Lunday, Hanif D. Sherali
JMLR
2010
115views more  JMLR 2010»
13 years 4 months ago
Bayesian structure discovery in Bayesian networks with less space
Current exact algorithms for score-based structure discovery in Bayesian networks on n nodes run in time and space within a polynomial factor of 2n . For practical use, the space ...
Pekka Parviainen, Mikko Koivisto