Sciweavers

2543 search results - page 422 / 509
» Optimal Ordered Problem Solver
Sort
View
IOR
2008
89views more  IOR 2008»
13 years 10 months ago
Impulse Control of Brownian Motion: The Constrained Average Cost Case
When a manufacturer places repeated orders with a supplier to meet changing production requirements, he faces the challenge of finding the right balance between holding costs and ...
Melda Ormeci, J. G. Dai, John H. Vande Vate
TIT
2010
115views Education» more  TIT 2010»
13 years 5 months ago
On resource allocation in fading multiple-access channels-an efficient approximate projection approach
We consider the problem of rate and power allocation in a multiple-access channel. Our objective is to obtain rate and power allocation policies that maximize a general concave ut...
Ali ParandehGheibi, Atilla Eryilmaz, Asuman E. Ozd...
CGO
2011
IEEE
13 years 2 months ago
Language and compiler support for auto-tuning variable-accuracy algorithms
—Approximating ideal program outputs is a common technique for solving computationally difficult problems, for adhering to processing or timing constraints, and for performance ...
Jason Ansel, Yee Lok Wong, Cy P. Chan, Marek Olsze...
SODA
2010
ACM
146views Algorithms» more  SODA 2010»
14 years 7 months ago
Classified Stable Matching
We introduce the classified stable matching problem, a problem motivated by academic hiring. Suppose that a number of institutes are hiring faculty members from a pool of applican...
Chien-Chung Huang
STACS
2007
Springer
14 years 4 months ago
Small Space Representations for Metric Min-Sum k -Clustering and Their Applications
The min-sum k-clustering problem is to partition a metric space (P, d) into k clusters C1, . . . , Ck ⊆ P such that k i=1 p,q∈Ci d(p, q) is minimized. We show the first effi...
Artur Czumaj, Christian Sohler