Sciweavers

14 search results - page 2 / 3
» Randomized Rounding for Routing and Covering Problems: Exper...
Sort
View
COR
2008
111views more  COR 2008»
13 years 4 months ago
An optimization algorithm for the inventory routing problem 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
CORR
2004
Springer
119views Education» more  CORR 2004»
13 years 4 months ago
The Largest Compatible Subset Problem for Phylogenetic Data
Abstract. The phylogenetic tree construction is to infer the evolutionary relationship between species from the experimental data. However, the experimental data are often imperfec...
Andy Auyeung, Ajith Abraham
CORR
2008
Springer
141views Education» more  CORR 2008»
13 years 4 months ago
Truthful Unsplittable Flow for Large Capacity Networks
The unsplittable flow problem is one of the most extensively studied optimization problems in the field of networking. An instance of it consists of an edge capacitated graph and ...
Yossi Azar, Iftah Gamzu, Shai Gutner
ICCAD
2002
IEEE
161views Hardware» more  ICCAD 2002»
14 years 1 months ago
Non-tree routing for reliability and yield improvement
We propose to introduce redundant interconnects for manufacturing yield and reliability improvement. By introducing redundant interconnects, the potential for open faults is reduc...
Andrew B. Kahng, Bao Liu, Ion I. Mandoiu
EMNLP
2007
13 years 6 months ago
Improving Query Spelling Correction Using Web Search Results
Traditional research on spelling correction in natural language processing and information retrieval literature mostly relies on pre-defined lexicons to detect spelling errors. Bu...
Qing Chen, Mu Li, Ming Zhou