2434 search results - page 355 / 487 » Algorithmic Randomness of Closed Sets |
135
Voted
ICDT
2010
ACM
15 years 2 months ago
2010
ACM
Schema mapping composition is a fundamental operation in schema management and data exchange. The mapping composition problem has been extensively studied for a number of mapping ...
234
click to vote
PODS
2009
ACM
16 years 4 months ago
2009
ACM
Database technology is playing an increasingly important role in understanding and solving large-scale and complex scientific and societal problems and phenomena, for instance, un...
119
click to vote
SPAA
2010
ACM
15 years 8 months ago
2010
ACM
In this paper we study a dynamic version of capacity maximization in the physical model of wireless communication. In our model, requests for connections between pairs of points i...
148
click to vote
CORR
2008
Springer
15 years 3 months ago
2008
Springer
This paper presents improved approximation algorithms for the problem of multiprocessor scheduling under uncertainty (SUU), in which the execution of each job may fail probabilist...
160
Voted
ATAL
2011
Springer
14 years 3 months ago
2011
Springer
The fastest known algorithm for solving General Bayesian Stackelberg games with a finite set of follower (adversary) types have seen direct practical use at the LAX airport for o...