Sciweavers

1332 search results - page 136 / 267
» Combinatorial Algorithms
Sort
View
ICALP
2005
Springer
14 years 2 months ago
Randomized Fast Design of Short DNA Words
We consider the problem of efficiently designing sets (codes) of equal-length DNA strings (words) that satisfy certain combinatorial constraints. This problem has numerous motivati...
Ming-Yang Kao, Manan Sanghi, Robert T. Schweller
EOR
2007
76views more  EOR 2007»
13 years 9 months ago
Multicriteria tour planning for mobile healthcare facilities in a developing country
A multiobjective combinatorial optimization (MOCO) formulation for the following location-routing problem in healthcare management is given: For a mobile healthcare facility, a cl...
Karl Doerner, Axel Focke, Walter J. Gutjahr
ANOR
2005
120views more  ANOR 2005»
13 years 9 months ago
Solving the Vehicle Routing Problem with Stochastic Demands using the Cross-Entropy Method
An alternate formulation of the classical vehicle routing problem with stochastic demands (VRPSD) is considered. We propose a new heuristic method to solve the problem. The algori...
Krishna Chepuri, Tito Homem-de-Mello
ICRA
2010
IEEE
227views Robotics» more  ICRA 2010»
13 years 7 months ago
Efficient multi-view object recognition and full pose estimation
We present an approach for efficiently recognizing all objects in a scene and estimating their full pose from multiple views. Our approach builds upon a state of the art single-vie...
Alvaro Collet, Siddhartha S. Srinivasa
RECSYS
2009
ACM
14 years 3 months ago
Uncovering functional dependencies in MDD-compiled product catalogues
A functional dependency is a logical relationship amongst the attributes that define a table of data. Specifically, a functional dependency holds when the values of a subset of ...
Tarik Hadzic, Barry O'Sullivan