5158 search results - page 261 / 1032 » Generalization of the Dempster-Shafer Theory |
205
click to vote
PODC
2009
ACM
16 years 7 months ago
2009
ACM
The paper presents distributed and parallel -approximation algorithms for covering problems, where is the maximum number of variables on which any constraint depends (for example...
152
click to vote
KDD
2009
ACM
16 years 7 months ago
2009
ACM
Given a task T , a pool of individuals X with different skills, and a social network G that captures the compatibility among these individuals, we study the problem of finding X ,...
171
click to vote
CHI
2004
ACM
16 years 7 months ago
2004
ACM
We present a method for performing selection tasks based on continuous control of multiple, competing agents who try to determine the user's intentions from their control beh...
259
click to vote
POPL
2006
ACM
16 years 7 months ago
2006
ACM
This article presents a polymorphic modal type system and its principal type inference algorithm that conservatively extend ML by all of Lisp's staging constructs (the quasi-...
312
click to vote
POPL
2005
ACM
16 years 7 months ago
2005
ACM
Traditional class and object encodings are difficult to use in practical type-preserving compilers because of the complexity of the encodings. We propose a simple typed intermedia...