Sciweavers

1034 search results - page 126 / 207
» Competitive generalized auctions
Sort
View
MANSCI
2006
104views more  MANSCI 2006»
13 years 9 months ago
Procuring Fast Delivery: Sole Sourcing with Information Asymmetry
This paper studies a queuing model in which a buyer sources a good or service from an single supplier chosen from a pool of suppliers. The buyer seeks to minimize the sum of her p...
Gérard P. Cachon, Fuqiang Zhang
ICDM
2007
IEEE
109views Data Mining» more  ICDM 2007»
14 years 3 months ago
A Support Vector Approach to Censored Targets
Censored targets, such as the time to events in survival analysis, can generally be represented by intervals on the real line. In this paper, we propose a novel support vector tec...
Pannagadatta K. Shivaswamy, Wei Chu, Martin Jansch...
CSCLP
2004
Springer
14 years 2 months ago
Automatically Exploiting Symmetries in Constraint Programming
We introduce a framework for studying and solving a class of CSP formulations. The framework allows constraints to be expressed as linear and nonlinear equations, then compiles th...
Arathi Ramani, Igor L. Markov
ANOR
2010
153views more  ANOR 2010»
13 years 6 months ago
Solving the Rectangular assignment problem and applications
The rectangular assignment problem is a generalization of the linear assignment problem (LAP): one wants to assign a number of persons to a smaller number of jobs, minimizing the ...
J. Bijsterbosch, A. Volgenant
STOC
2004
ACM
158views Algorithms» more  STOC 2004»
14 years 9 months ago
Collective asynchronous reading with polylogarithmic worst-case overhead
The Collect problem for an asynchronous shared-memory system has the objective for the processors to learn all values of a collection of shared registers, while minimizing the tot...
Bogdan S. Chlebus, Dariusz R. Kowalski, Alexander ...