Sciweavers

388 search results - page 41 / 78
» A Mixed Closure-CSP Method to Solve Scheduling Problems
Sort
View
COR
2004
139views more  COR 2004»
14 years 11 months ago
A tabu search heuristic for the vehicle routing problem with time windows and split deliveries
The routing of a fleet of vehicles to service a set of customers is important in the field of distribution. Vehicle Routing Problems (VRP) arise in many real-life applications wit...
Sin C. Ho, Dag Haugland
HM
2010
Springer
146views Optimization» more  HM 2010»
14 years 12 months ago
An Improved Memetic Algorithm for Break Scheduling
In this paper we consider solving a complex real life break scheduling problem. This problem of high practical relevance arises in many working areas, e.g. in air traffic control a...
Magdalena Widl, Nysret Musliu
ICC
2008
IEEE
161views Communications» more  ICC 2008»
15 years 6 months ago
Joint Power Control and Link Scheduling in Wireless Networks for Throughput Optimization
—This paper concerns the problem of finding the minimum-length TDMA frame of a power-controlled wireless network subject to traffic demands and SINR (signalto-interference-plus...
Liqun Fu, Soung Chang Liew, Jianwei Huang
SJ
2010
136views more  SJ 2010»
14 years 6 months ago
Optimizing the Migration to Future-Generation Passive Optical Networks (PON)
We study the upgrading problem of existing Passive Optical Networks (PONs) that need to increase their capacity at different points in time. Our method upgrades line rates and migr...
M. De Andrade, Massimo Tornatore, S. Sallent, Bisw...
PKDD
2009
Springer
113views Data Mining» more  PKDD 2009»
15 years 6 months ago
Feature Selection for Density Level-Sets
A frequent problem in density level-set estimation is the choice of the right features that give rise to compact and concise representations of the observed data. We present an e...
Marius Kloft, Shinichi Nakajima, Ulf Brefeld