Sciweavers

408 search results - page 27 / 82
» On a stochastic sequencing and scheduling problem
Sort
View
WSC
2008
13 years 10 months ago
Approximate dynamic programming: Lessons from the field
Approximate dynamic programming is emerging as a powerful tool for certain classes of multistage stochastic, dynamic problems that arise in operations research. It has been applie...
Warren B. Powell
CIKM
1999
Springer
14 years 19 hour ago
Page Access Scheduling in Join Processing
The join relational operation is one of the most expensive among database operations. In this study, we consider the problem of scheduling page accesses in join processing. This r...
Andrew Lim, Jennifer Lai-Pheng Kwan, Wee-Chong Oon
IPCO
2007
94views Optimization» more  IPCO 2007»
13 years 9 months ago
Infrastructure Leasing Problems
Consider the following Steiner Tree leasing problem. Given a graph G = (V, E) with root r, and a sequence of terminal sets Dt ⊆ V for each day t ∈ [T]. A feasible solution to t...
Barbara M. Anthony, Anupam Gupta
WICON
2008
13 years 9 months ago
Stability regions of two-way relaying with network coding
We consider a pair of nodes with stochastic traffic flows who wish to communicate in a bi-directional communication scenario using intermediate relays in two-hop fashion. Intermed...
Ertugrul Necdet Ciftcioglu, Aylin Yener, Randall B...
GECCO
1999
Springer
158views Optimization» more  GECCO 1999»
14 years 9 hour ago
Coevolutionary Genetic Algorithms for Solving Dynamic Constraint Satisfaction Problems
In this paper, we discuss the adaptability of Coevolutionary Genetic Algorithms on dynamic environments. Our CGA consists of two populations: solution-level one and schema-level o...
Hisashi Handa, Osamu Katai, Tadataka Konishi, Mits...