Sciweavers

784 search results - page 44 / 157
» Relaxing the Value Restriction
Sort
View
SIGECOM
2003
ACM
106views ECommerce» more  SIGECOM 2003»
14 years 3 months ago
Envy-free auctions for digital goods
We study auctions for a commodity in unlimited supply, e.g., a digital good. In particular we consider three desirable properties for auctions: • Competitive: the auction achiev...
Andrew V. Goldberg, Jason D. Hartline
ICPP
1991
IEEE
14 years 1 months ago
Two Techniques to Enhance the Performance of Memory Consistency Models
The memory consistency model supported by a multiprocessor directly affects its performance. Thus, several attempts have been made to relax the consistency models to allow for mor...
Kourosh Gharachorloo, Anoop Gupta, John L. Henness...
ATMOS
2007
152views Optimization» more  ATMOS 2007»
13 years 11 months ago
Solution of the Train Platforming Problem
In this paper we study a general formulation of the train platforming problem, which contains as special cases all the versions previously considered in the literature as well as a...
Alberto Caprara, Laura Galli, Paolo Toth
CORR
2010
Springer
159views Education» more  CORR 2010»
13 years 7 months ago
On optimizing over lift-and-project closures
The lift-and-project closure is the relaxation obtained by computing all lift-and-project cuts from the initial formulation of a mixed integer linear program or equivalently by co...
Pierre Bonami
TSP
2010
13 years 4 months ago
Code design for radar STAP via optimization theory
Abstract--In this paper, we deal with the problem of constrained code optimization for radar space-time adaptive processing (STAP) in the presence of colored Gaussian disturbance. ...
Antonio De Maio, Silvio De Nicola, Yongwei Huang, ...