Sciweavers

5100 search results - page 590 / 1020
» The Linear Complexity of a Graph
Sort
View
COR
2007
95views more  COR 2007»
15 years 6 months ago
Inventory routing with continuous moves
The typical inventory routing problem deals with the repeated distribution of a single product from a single facility with an unlimited supply to a set of customers that can all b...
Martin W. P. Savelsbergh, Jin-Hwa Song
192
Voted
JCSS
2008
96views more  JCSS 2008»
15 years 6 months ago
A combinatorial characterization of resolution width
We provide a characterization of the resolution width introduced in the context of propositional proof complexity in terms of the existential pebble game introduced in the context...
Albert Atserias, Víctor Dalmau
EOR
2007
101views more  EOR 2007»
15 years 6 months ago
Comprehensible credit scoring models using rule extraction from support vector machines
In recent years, Support Vector Machines (SVMs) were successfully applied to a wide range of applications. Their good performance is achieved by an implicit non-linear transformat...
David Martens, Bart Baesens, Tony Van Gestel, Jan ...
KES
2006
Springer
15 years 6 months ago
Sensor Network Localization Using Least Squares Kernel Regression
Abstract. This paper considers the sensor network localization problem using signal strength. Unlike range-based methods signal strength information is stored in a kernel matrix. L...
Anthony Kuh, Chaopin Zhu, Danilo P. Mandic
140
Voted
NA
2006
84views more  NA 2006»
15 years 6 months ago
Fast Moreau envelope computation I: numerical algorithms
Abstract. The present article summarizes the state of the art algorithms to compute the discrete Moreau envelope, and presents a new linear-time algorithm, named NEP for NonExpansi...
Yves Lucet