3820 search results - page 416 / 764 » Bounded Model Debugging |
141
click to vote
QEST
2008
IEEE
15 years 10 months ago
2008
IEEE
Magnifying Lens Abstraction in Markov Decision Processes ∗ Pritam Roy1 David Parker2 Gethin Norman2 Luca de Alfaro1 Computer Engineering Dept, UC Santa Cruz, Santa Cruz, CA, USA ...
144
click to vote
CP
2007
Springer
15 years 10 months ago
2007
Springer
Searching for optimal solutions to a problem using lower bounds obtained from a relaxation is a common idea in Heuristic Search and Planning. In SAT and CSPs, however, explicit rel...
150
click to vote
IOPADS
1997
15 years 5 months ago
1997
We provide a competitive analysis framework for online prefetching and buffer management algorithms in parallel I/O systems, using a read-once model of block references. This has ...
128
click to vote
DM
2007
15 years 4 months ago
2007
In this paper, we address the problem of λ labelings, that was introduced in the context of frequency assignment for telecommunication networks. In this model, stations within a ...
232
click to vote
MSWIM
2009
ACM
15 years 11 months ago
2009
ACM
It is common practice in wireless multihop network evaluations to ignore interfering signals below a certain signal strength threshold. This paper investigates the thesis that thi...