Sciweavers

364 search results - page 7 / 73
» A benchmark for the sorting network problem
Sort
View
INFORMS
2008
62views more  INFORMS 2008»
13 years 6 months ago
A Stochastic Approximation Method to Compute Bid Prices in Network Revenue Management Problems
We present a stochastic approximation method to compute bid prices in network revenue management problems. The key idea is to visualize the total expected revenue as a function of...
Huseyin Topaloglu
IPPS
2000
IEEE
13 years 11 months ago
Heuristic Solutions for a Mapping Problem in a TV-Anytime Server Network
This paper presents a novel broadband multimedia service called TV-Anytime. The basic idea of this service is to store broadcast media assets onto media server systems and allow c...
Xiaobo Zhou, Reinhard Lüling, Li Xie
GECCO
2004
Springer
145views Optimization» more  GECCO 2004»
14 years 2 days ago
Automated Extraction of Problem Structure
Most problems studied in artificial intelligence possess some form of structure, but a precise way to define such structure is so far lacking. We investigate how the notion of pr...
Anthony Bucci, Jordan B. Pollack, Edwin D. de Jong
GLOBECOM
2008
IEEE
14 years 1 months ago
On Spectrum Sharing in Cooperative Multiple Access Networks
Abstract— The coexistence and resource sharing between a primary network utilizing cognitive relays and a secondary network are investigated. Two multiple access protocols are pr...
Amr El-Sherif, Ahmed K. Sadek, K. J. Ray Liu
ANOR
2010
130views more  ANOR 2010»
13 years 4 months ago
Greedy scheduling with custom-made objectives
We present a methodology to automatically generate an online job scheduling method for a custom-made objective and real workloads. The scheduling problem comprises independent para...
Carsten Franke, Joachim Lepping, Uwe Schwiegelshoh...