Sciweavers

1292 search results - page 219 / 259
» Revisiting the optimal scheduling problem
Sort
View
CP
2003
Springer
15 years 3 months ago
Cost-Based Filtering for Shorter Path Constraints
Abstract. Many real world problems, e.g. personnel scheduling and transportation planning, can be modeled naturally as Constrained Shortest Path Problems (CSPPs), i.e., as Shortest...
Meinolf Sellmann
ICS
2005
Tsinghua U.
15 years 3 months ago
Continuous Replica Placement schemes in distributed systems
The Replica Placement Problem (RPP) aims at creating a set of duplicated data objects across the nodes of a distributed system in order to optimize certain criteria. Typically, RP...
Thanasis Loukopoulos, Petros Lampsas, Ishfaq Ahmad
GLOBECOM
2006
IEEE
15 years 3 months ago
Two-Level Dynamic Bandwidth Allocation for a Space-to-Ground Relay Network
Abstract-We address issues related to efficiency, fairness, endto-end delay minimization and Quality-of-Service in order to enable a flexible access and dynamic mission operation c...
Hui Zeng, Michael H. Hadjitheodosiou, John S. Bara...
INFOCOM
2007
IEEE
15 years 4 months ago
Low-Complexity and Distributed Energy Minimization in Multi-Hop Wireless Networks
— In this work, we study the problem of minimizing the total power consumption in a multi-hop wireless network subject to a given offered load. It is well-known that the total po...
Longbi Lin, Xiaojun Lin, Ness B. Shroff
ATMOS
2007
114views Optimization» more  ATMOS 2007»
14 years 11 months ago
Fast Approaches to Robust Railway Timetabling
The Train Timetabling Problem (TTP) consists in finding a train schedule on a railway network that satisfies some operational constraints and maximizes a profit function which c...
Matteo Fischetti, Arrigo Zanette, Domenico Salvagn...