Sciweavers

703 search results - page 111 / 141
» Maintenance scheduling problems as benchmarks for constraint...
Sort
View
STOC
2004
ACM
150views Algorithms» more  STOC 2004»
14 years 8 months ago
Typical properties of winners and losers in discrete optimization
We present a probabilistic analysis for a large class of combinatorial optimization problems containing, e.g., all binary optimization problems defined by linear constraints and a...
René Beier, Berthold Vöcking
TSP
2010
13 years 3 months ago
Power allocation for a MIMO relay system with multiple-antenna users
A power allocation or scheduling problem is studied for a multiuser multiple-input multiple-output (MIMO) wireless relay system where there is a non-regenerative relay between one ...
Yuan Yu, Yingbo Hua
AAAI
2000
13 years 9 months ago
Human-Guided Simple Search
Scheduling, routing, and layout tasks are examples of hard operations-research problems that have broad application in industry. Typical algorithms for these problems combine some...
David Anderson, Emily Anderson, Neal Lesh, Joe Mar...
DAC
1995
ACM
14 years 1 days ago
A Transformation-Based Approach for Storage Optimization
High-level synthesis (HLS) has been successfully targeted towards the digital signal processing (DSP) domain. Both application-speci c integrated circuits (ASICs) and application-...
Wei-Kai Cheng, Youn-Long Lin
IAT
2010
IEEE
13 years 6 months ago
Getting What You Pay For: Is Exploration in Distributed Hill Climbing Really Worth it?
Abstract--The Distributed Stochastic Algorithm (DSA), Distributed Breakout Algorithm (DBA), and variations such as Distributed Simulated Annealing (DSAN), MGM-1, and DisPeL, are di...
Melanie Smith, Roger Mailler