Sciweavers

1921 search results - page 228 / 385
» The Student-Project Allocation Problem
Sort
View
IOR
2007
106views more  IOR 2007»
15 years 6 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
PODS
2004
ACM
128views Database» more  PODS 2004»
16 years 6 months ago
Replicated Declustering of Spatial Data
The problem of disk declustering is to distribute data among multiple disks to reduce query response times through parallel I/O. A strictly optimal declustering technique is one t...
Hakan Ferhatosmanoglu, Aravind Ramachandran, Ali S...
ICC
2009
IEEE
151views Communications» more  ICC 2009»
16 years 1 months ago
Slow Adaptive OFDMA via Stochastic Programming
—Fueled by the promises of high spectral efficiency, adaptive OFDMA has attracted enormous research interests over the last decade. The significant capacity gain of adaptive OF...
Wei Liang (William) Li, Ying Jun (Angela) Zhang, M...
IPPS
2008
IEEE
16 years 29 days ago
A game theoretical data replication technique for mobile ad hoc networks
Adaptive replication of data items on servers of a mobile ad hoc network can alleviate access delays. The selection of data items and servers requires solving a constrained optimi...
Samee Ullah Khan, Anthony A. Maciejewski, Howard J...
CORR
2010
Springer
151views Education» more  CORR 2010»
15 years 3 months ago
Selective Call Out and Real Time Bidding
Display ads on the Internet are increasingly sold via ad exchanges such as RightMedia, AdECN and Doubleclick Ad Exchange. These exchanges allow real-time bidding, that is, each ti...
Tanmoy Chakraborty, Eyal Even-Dar, Sudipto Guha, Y...