Sciweavers

511 search results - page 68 / 103
» Using Combinatorial Optimization Methods for Quantification ...
Sort
View
151
Voted
GECCO
2007
Springer
326views Optimization» more  GECCO 2007»
15 years 10 months ago
Binary differential evolution for the unit commitment problem
The Unit Commitment Problem (UCP) is the task of finding an optimal turn on and turn off schedule for a group of power generation units over a given time horizon to minimize ope...
Ali Keles
147
Voted
DAC
1996
ACM
15 years 8 months ago
A Hardware/Software Partitioning Algorithm for Designing Pipelined ASIPs with Least Gate Counts
Abstract -- This paper introduces a new HW/SW partitioning algorithm used in automating the instruction set processor design for pipelined ASIP (Application Specific Integrated Pro...
Nguyen-Ngoc Bình, Masaharu Imai, Akichika S...
GECCO
2010
Springer
162views Optimization» more  GECCO 2010»
15 years 8 months ago
Heuristics for sampling repetitions in noisy landscapes with fitness caching
For many large-scale combinatorial search/optimization problems, meta-heuristic algorithms face noisy objective functions, coupled with computationally expensive evaluation times....
Forrest Stonedahl, Susa H. Stonedahl
FOCS
2005
IEEE
15 years 9 months ago
Sampling-based Approximation Algorithms for Multi-stage Stochastic
Stochastic optimization problems provide a means to model uncertainty in the input data where the uncertainty is modeled by a probability distribution over the possible realizatio...
Chaitanya Swamy, David B. Shmoys
122
Voted
ICC
2008
IEEE
150views Communications» more  ICC 2008»
15 years 10 months ago
Adaptive Modulation-Based TCP-Aware Uplink Scheduling in IEEE 802.16 Networks
— In this paper we propose polling based uplink scheduling schemes for TCP based applications in a multipointto-point fixed broadband IEEE 802.16 network. Our schemes adapt the ...
Hemant Kumar Rath, Abhay Karandikar, Vishal Sharma