3172 search results - page 109 / 635 » On the Random-Self-Reducibility of Complete Sets |
176
click to vote
APPROX
2006
Springer
15 years 10 months ago
2006
Springer
Motivated by applications in batch scheduling of jobs in manufacturing systems and distributed computing, we study two related problems. Given is a set of jobs {J1, . . . , Jn}, w...
134
click to vote
CHI
2009
ACM
16 years 7 months ago
2009
ACM
Many surface computing prototypes have employed gestures created by system designers. Although such gestures are appropriate for early investigations, they are not necessarily ref...
159
click to vote
MHCI
2009
Springer
16 years 28 days ago
2009
Springer
An increasing number of households are equipped with a large number of TV sets and more and more of them are large highresolution displays. Furthermore, we see the integration of ...
158
click to vote
CSL
2007
Springer
16 years 17 days ago
2007
Springer
Abstract. Sequent calculi usually provide a general deductive setting that uniformly embeds other proof-theoretical approaches, such as tableaux methods, resolution techniques, goa...
197
click to vote
TARK
2007
Springer
16 years 15 days ago
2007
Springer
We investigate the discrete (finite) case of the Popper-Renyi theory of conditional probability, introducing discrete conditional probabilistic models for (multi-agent) knowledge...