Sciweavers

4345 search results - page 460 / 869
» Temporal Constraint Networks
Sort
View
ATMOS
2007
119views Optimization» more  ATMOS 2007»
15 years 8 months ago
Models for Railway Track Allocation
The optimal track allocation problem (OPTRA) is to find, in a given railway network, a conflict free set of train routes of maximum value. We study two types of integer programmi...
Ralf Borndörfer, Thomas Schlechte
179
Voted
COR
2006
95views more  COR 2006»
15 years 6 months ago
Hybrid meta-heuristics algorithms for task assignment in heterogeneous computing systems
In this paper we tackle the task assignment problem (TSAP) in heterogeneous computer systems. The TSAP consists of assigning a given distributed computer program formed by a numbe...
Sancho Salcedo-Sanz, Yong Xu, Xin Yao
197
Voted
IJCV
2006
166views more  IJCV 2006»
15 years 6 months ago
Fast Constrained Surface Extraction by Minimal Paths
A new approach performing surface extraction from 3D images under user defined geometrical constraints is presented. The constraints are introduced through boundary curves given by...
Roberto Ardon, Laurent D. Cohen
TVCG
2011
120views more  TVCG 2011»
15 years 1 months ago
Drawing and Labeling High-Quality Metro Maps by Mixed-Integer Programming
—Metro maps are schematic diagrams of public transport networks that serve as visual aids for route planning and navigation tasks. It is a challenging problem in network visualiz...
Martin Nöllenburg, Alexander Wolff
INFOCOM
2012
IEEE
13 years 9 months ago
Strategizing surveillance for resource-constrained event monitoring
—Surveillance systems, such as sensor networks and surveillance camera networks, have been widely deployed to monitor events in many different scenarios. One common way to conser...
Xi Fang, Dejun Yang, Guoliang Xue