17 search results - page 1 / 4 » Summarizing CSP Hardness with Continuous Probability Distrib... |
AAAI
1997
13 years 6 months ago
1997
We present empirical evidence that the distribution of e ort required to solve CSPs randomly generated at the 50% satis able point, when using a backtracking algorithm, can be app...
NAACL
2010
13 years 2 months ago
2010
This paper analyzes the topic identification stage of single-document automatic text summarization across four different domains, consisting of newswire, literary, scientific and ...
SIGMETRICS
2012
ACM
11 years 7 months ago
2012
ACM
In this paper we study the behavior of a continuous time random walk (CTRW) on a stationary and ergodic time varying dynamic graph. We establish conditions under which the CTRW is...
MPC
2010
Springer
13 years 9 months ago
2010
Springer
d Abstract) Jane Hillston Laboratory for Foundations of Computer Science, The University of Edinburgh, Scotland Quantitative Analysis Stochastic process algebras extend classical p...
GLVLSI
2006
IEEE
13 years 10 months ago
2006
IEEE
Dynamic voltage scaling (DVS) for real-time systems has been extensively studied to save energy. Previous studies consider the probabilistic distributions of tasks’ execution ti...