Sciweavers

112 search results - page 17 / 23
» Labeled Traveling Salesman Problems: Complexity and approxim...
Sort
View
ATMOS
2010
183views Optimization» more  ATMOS 2010»
13 years 6 months ago
The Complexity of Integrating Routing Decisions in Public Transportation Models
To model and solve optimization problems arising in public transportation, data about the passengers is necessary and has to be included in the models in any phase of the planning...
Marie Schmidt, Anita Schöbel
CDC
2009
IEEE
129views Control Systems» more  CDC 2009»
14 years 6 days ago
Resource allocation for signal detection with active sensors
— We consider the problem of determining the existence of known constant signals over a set of sites, given noisy measurements obtained by a team of active sensors that can switc...
Jerome Le Ny, Michael M. Zavlanos, George J. Pappa...
TALG
2010
86views more  TALG 2010»
13 years 5 months ago
Approximating corridors and tours via restriction and relaxation techniques
Given a rectangular boundary partitioned into rectangles, the Minimum-Length Corridor (MLC-R) problem consists of finding a corridor of least total length. A corridor is a set of ...
Arturo Gonzalez-Gutierrez, Teofilo F. Gonzalez
ECCV
2010
Springer
14 years 21 days ago
Stacked Hierarchical Labeling
In this work we propose a hierarchical approach for labeling semantic objects and regions in scenes. Our approach is reminiscent of early vision literature in that we use a decompo...
COSIT
1995
Springer
103views GIS» more  COSIT 1995»
13 years 11 months ago
On the Determination of the Optimum Path in Space
: Various algorithms have been proposed for the determination of the optimum paths in line networks. Moving in space is a far more complex problem, where research has been scarce. ...
Emmanuel Stefanakis, Marinos Kavouras