4480 search results - page 305 / 896 » Prototyping Completion with Constraints Using Computational ... |
159
click to vote
AAAI
2006
15 years 8 months ago
2006
For many large systems the computational complexity of complete model-based diagnosis is prohibitive. In this paper we investigate the speedup of the diagnosis process by exploiti...
156
click to vote
SIGMETRICS
2009
ACM
16 years 1 months ago
2009
ACM
We present a system for allocating resources in shared data and compute clusters that improves MapReduce job scheduling in three ways. First, the system uses regulated and user-as...
140
click to vote
CCS
2009
ACM
16 years 7 months ago
2009
ACM
Despite several research studies, the effective analysis of policy based systems remains a significant challenge. Policy analysis should at least (i) be expressive (ii) take accou...
140
click to vote
PPDP
2010
Springer
15 years 5 months ago
2010
Springer
Common record systems only provide access to individual record fields. However, it is often useful to have generic record combinators, that is, functions that work with complete ...
197
Voted
MFCS
2001
Springer
15 years 11 months ago
2001
Springer
Combinatorial games lead to several interesting, clean problems in algorithms and complexity theory, many of which remain open. The purpose of this paper is to provide an overview...