Sciweavers

50 search results - page 10 / 10
» Fairness in Combinatorial Auctioning Systems
Sort
View
ATAL
2010
Springer
13 years 6 months ago
Automated negotiation with decommitment for dynamic resource allocation in cloud computing
We consider the problem of allocating networked resources in dynamic environment, such as cloud computing platforms, where providers strategically price resources to maximize thei...
Bo An, Victor R. Lesser, David Irwin, Michael Zink
GRID
2007
Springer
13 years 11 months ago
Eliciting honest value information in a batch-queue environment
Abstract— Markets and auctions have been proposed as mechanisms for efficiently and fairly allocating resources in a number of different computational settings. Economic approac...
Andrew Mutz, Richard Wolski, John Brevik
ECR
2007
116views more  ECR 2007»
13 years 4 months ago
Enabling assisted strategic negotiations in actual-world procurement scenarios
In the everyday business world, the sourcing process of multiple goods and services usually involves complex negotiations (via telephone, fax, etc) that include discussion of prod...
Jesús Cerquides, Maite López-S&aacut...
PODS
2007
ACM
142views Database» more  PODS 2007»
14 years 5 months ago
Quasi-inverses of schema mappings
Schema mappings are high-level specifications that describe the relationship between two database schemas. Two operators on schema mappings, namely the composition operator and th...
Ronald Fagin, Phokion G. Kolaitis, Lucian Popa, Wa...
CGF
2006
191views more  CGF 2006»
13 years 5 months ago
A Robust Two-Step Procedure for Quad-Dominant Remeshing
We propose a new technique for quad-dominant remeshing which separates the local regularity requirements from the global alignment requirements by working in two steps. In the fir...
Martin Marinov, Leif Kobbelt