Sciweavers

817 search results - page 119 / 164
» Exact solutions to linear programming problems
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
GLOBECOM
2007
IEEE
14 years 2 months ago
Cognitive Medium Access: A Protocol for Enhancing Coexistence in WLAN Bands
— In this paper we propose Cognitive Medium Access (CMA), a protocol aimed at improving coexistence with a set of independently evolving WLAN bands. A time-slotted physical layer...
Stefan Geirhofer, Lang Tong, Brian M. Sadler
ECRTS
2006
IEEE
14 years 1 months ago
Optimal On-Line Scheduling of Multiple Control Tasks: A Case Study
We study the problem of dynamically scheduling a set of state-feedback control tasks controlling a set of linear plants. We consider an on-line non-preemptive scheduling policy th...
Anton Cervin, Peter Alriksson
ISCAS
2005
IEEE
147views Hardware» more  ISCAS 2005»
14 years 1 months ago
A heuristic approach for multiple restricted multiplication
— This paper introduces a heuristic solution to the multiple restricted multiplication (MRM) optimization problem. MRM refers to a situation where a single variable is multiplied...
Nalin Sidahao, George A. Constantinides, Peter Y. ...
FPL
2005
Springer
100views Hardware» more  FPL 2005»
14 years 1 months ago
Power and Area Optimization for Multiple Restricted Multiplication
This paper presents a design and optimization technique for the Multiple Restricted Multiplication problem [1]. This refers to a situation where a single variable is multiplied by...
Nalin Sidahao, George A. Constantinides, Peter Y. ...