7106 search results - page 312 / 1422 » Restricted Complexity, General Complexity |
177
click to vote
SIGECOM
2005
ACM
15 years 10 months ago
2005
ACM
This paper concerns the design of mechanisms for online scheduling in which agents bid for access to a re-usable resource such as processor time or wireless network access. Each a...
159
click to vote
ICDT
2010
ACM
15 years 9 months ago
2010
ACM
The paper formulates and investigates the aggregation problem for synthesized mediators of Web services (SWMs). An SWM is a finite-state transducer defined in terms of templates...
154
click to vote
ICDCS
1999
IEEE
15 years 9 months ago
1999
IEEE
To provide real-time service or engineer constrained-based paths, networks require the underlying routing algorithm to be able to find low-cost paths that satisfy given Quality-of...
168
click to vote
STOC
2010
ACM
15 years 8 months ago
2010
ACM
The spectral profile of a graph is a natural generalization of the classical notion of its Rayleigh quotient. Roughly speaking, given a graph G, for each 0 < < 1, the spect...
169
click to vote
COCO
1994
Springer
15 years 8 months ago
1994
Springer
A probabilistically checkable debate system (PCDS) for a language L consists of a probabilisticpolynomial-time veri er V and a debate between Player 1, who claims that the input x ...