Sciweavers

3820 search results - page 96 / 764
» Bounded Model Debugging
Sort
View
CAV
2008
Springer
108views Hardware» more  CAV 2008»
15 years 4 months ago
Reducing Concurrent Analysis Under a Context Bound to Sequential Analysis
This paper addresses the analysis of concurrent programs with shared memory. Such an analysis is undecidable in the presence of multiple procedures. One approach used in recent wor...
Akash Lal, Thomas W. Reps
ICASSP
2008
IEEE
15 years 8 months ago
Bounds and algorithms for time delay estimation on parallel, flat fading channels
We study time delay estimation (TDE) on parallel channels with flat fading. Several models for the channel gains are considered, and for each case we present the the maximum like...
Richard J. Kozick, Brian M. Sadler
109
Voted
UAI
2008
15 years 3 months ago
Bounding Search Space Size via (Hyper)tree Decompositions
This paper develops a measure for bounding the performance of AND/OR search algorithms for solving a variety of queries over graphical models. We show how drawing a connection to ...
Lars Otten, Rina Dechter
ANOR
2007
80views more  ANOR 2007»
15 years 2 months ago
Branch and bound, integer, and non-integer programming
In this note we review the development of the first commercial branch and bound codes at CEIR/Scicon, with particular emphasis on those features not commonly emphasized today - t...
John J. H. Forrest, John A. Tomlin
CORR
2008
Springer
58views Education» more  CORR 2008»
15 years 2 months ago
Tight Bounds on Minimum Maximum Pointwise Redundancy
This paper presents new lower and upper bounds for the optimal compression of binary prefix codes in terms of the most probable input symbol, where compression efficiency is determ...
Michael Baer