1732 search results - page 116 / 347 » Sequences of Level 1, 2, 3, ..., k , .. |
177
click to vote
WINE
2010
Springer
15 years 4 months ago
2010
Springer
We design algorithms for computing approximately revenue-maximizing sequential postedpricing mechanisms (SPM) in K-unit auctions, in a standard Bayesian model. A seller has K copi...
153
click to vote
APWEB
2005
Springer
16 years 1 hour ago
2005
Springer
Effective and efficient Quality of Service (QoS) management is critical for a service grid to meet the requirements of both grid users and service providers. We introduce Q-GSM, a ...
151
click to vote
ISSS
1995
IEEE
15 years 10 months ago
1995
IEEE
We present an integrated approach aimed at predicting layout area needed to implement a behavioral description for a given performance goal. Our approach is novel because: (1) it ...
200
click to vote
CORR
2012
Springer
14 years 2 months ago
2012
Springer
A distance oracle is a compact representation of the shortest distance matrix of a graph. It can be queried to retrieve approximate distances and corresponding paths between any p...
163
click to vote
EJC
2006
15 years 6 months ago
2006
A perfect matching in a k-uniform hypergraph on n vertices, n divisible by k, is a set of n/k disjoint edges. In this paper we give a sufficient condition for the existence of a p...