Sciweavers

840 search results - page 107 / 168
» Inapproximability of Combinatorial Optimization Problems
Sort
View
IEAAIE
2010
Springer
14 years 10 months ago
Percolating Swarm Dynamics
Swarm Intelligence has been a successful approach to solve some combinatorial problems through the metaphor of interacting evolving individuals of a a population P in a closed toru...
Manuel Graña, Carmen Hernández, Alic...
TASE
2010
IEEE
14 years 7 months ago
Optimization of Group Elevator Scheduling With Advance Information
Group elevator scheduling has received considerable attention due to its importance to transportation efficiency for mid-rise and high-rise buildings. One important trend to improv...
Jin Sun, Qianchuan Zhao, Peter B. Luh
81
Voted
ICASSP
2011
IEEE
14 years 4 months ago
Mixed-integer linear programming framework for max-min power control with single-stage interference cancellation
We consider a wireless network comprising a number of mutuallyinterfering links. We study the transmit power control problem that determines the egalitarian signal-to-interference...
Eleftherios Karipidis, Di Yuan, Erik G. Larsson
101
Voted
IEEEPACT
2007
IEEE
15 years 6 months ago
Automatic Correction of Loop Transformations
Loop nest optimization is a combinatorial problem. Due to the growing complexity of modern architectures, it involves two increasingly difficult tasks: (1) analyzing the profita...
Nicolas Vasilache, Albert Cohen, Louis-Noël P...
APIN
1999
114views more  APIN 1999»
15 years 2 days ago
Evolutionary Approaches to Figure-Ground Separation
The problem of figure-ground separation is tackled from the perspective of combinatorial optimization. Previous attempts have used deterministic optimization techniques based on re...
Suchendra M. Bhandarkar, Xia Zeng