Sciweavers

1941 search results - page 379 / 389
» On the Hardness of Approximate Reasoning
Sort
View
APPROX
2007
Springer
100views Algorithms» more  APPROX 2007»
15 years 3 months ago
Implementing Huge Sparse Random Graphs
Consider a scenario where one desires to simulate the execution of some graph algorithm on random input graphs of huge, perhaps even exponential size. Sampling and storing these h...
Moni Naor, Asaf Nussboim
EMSOFT
2007
Springer
15 years 3 months ago
WCET estimation for executables in the presence of data caches
This paper describes techniques to estimate the worst case execution time of executable code on architectures with data caches. The underlying mechanism is Abstract Interpretation...
Rathijit Sen, Y. N. Srikant
98
Voted
TACAS
2007
Springer
165views Algorithms» more  TACAS 2007»
15 years 3 months ago
Multi-objective Model Checking of Markov Decision Processes
We study and provide efficient algorithms for multi-objective model checking problems for Markov Decision Processes (MDPs). Given an MDP, M, and given multiple linear-time (ω-regu...
Kousha Etessami, Marta Z. Kwiatkowska, Moshe Y. Va...
ISSRE
2006
IEEE
15 years 3 months ago
Queuing Models for Field Defect Resolution Process
This paper explores a novel application of queuing theory to the corrective software maintenance problem to support quantitative balancing between resources and responsiveness. In...
Swapna S. Gokhale, Robert E. Mullen
82
Voted
SIGIR
2006
ACM
15 years 3 months ago
AggregateRank: bringing order to web sites
Since the website is one of the most important organizational structures of the Web, how to effectively rank websites has been essential to many Web applications, such as Web sear...
Guang Feng, Tie-Yan Liu, Ying Wang, Ying Bao, Zhim...