Sciweavers

213 search results - page 32 / 43
» A parallel integer programming approach to global routing
Sort
View
IOR
2007
106views more  IOR 2007»
13 years 7 months ago
Planning and Scheduling by Logic-Based Benders Decomposition
We combine mixed integer linear programming (MILP) and constraint programming (CP) to solve an important class of planning and scheduling problems. Tasks are allocated to faciliti...
John N. Hooker
INFOCOM
2012
IEEE
11 years 10 months ago
Truthful spectrum auction design for secondary networks
Abstract—Opportunistic wireless channel access by nonlicensed users has emerged as a promising solution for addressing the bandwidth scarcity challenge. Auctions represent a natu...
Yuefei Zhu, Baochun Li, Zongpeng Li
GLOBECOM
2007
IEEE
14 years 1 months ago
Using MILP for Optimal Movement Planning in MANETs with Cooperative Mobility
— Rapid-deployment mobile ad-hoc networks (MANETs) are frequently characterized by common overarching mission objectives which make it reasonable to expect some degree of coopera...
Ghassen Ben Brahim, Osama Awwad, Ala I. Al-Fuqaha,...
CCE
2004
13 years 7 months ago
Cyclic short-term scheduling of multiproduct batch plants using continuous-time representation
The idea of cyclic scheduling is commonly utilized to address short-term scheduling problems for multiproduct batch plants under the assumption of relatively stable operations and...
Dan Wu, Marianthi G. Ierapetritou
IPPS
2009
IEEE
14 years 2 months ago
High-level estimation and trade-off analysis for adaptive real-time systems
We propose a novel design estimation method for adaptive streaming applications to be implemented on a partially reconfigurable FPGA. Based on experimental results we enable accu...
Ingo Sander, Jun Zhu, Axel Jantsch, Andreas Herrho...