Sciweavers

1456 search results - page 128 / 292
» Two Techniques to Improve Finite Model Search
Sort
View
WSC
1998
13 years 9 months ago
Comparison of Bayesian and Frequentist Assessments of Uncertainty for Selecting the Best System
An important problem in discrete-event stochastic simulation is the selection of the best system from a finite set of alternatives. There are many techniques for ranking and selec...
Koichiro Inoue, Stephen E. Chick
JCS
2010
80views more  JCS 2010»
13 years 2 months ago
Constraint differentiation: Search-space reduction for the constraint-based analysis of security protocols
We introduce constraint differentiation, a powerful technique for reducing search when model-checking security protocols using constraint-based methods. Constraint differentiation...
Sebastian Mödersheim, Luca Viganò, Dav...
28
Voted
SIAMIS
2010
190views more  SIAMIS 2010»
13 years 2 months ago
Analysis and Generalizations of the Linearized Bregman Method
This paper analyzes and improves the linearized Bregman method for solving the basis pursuit and related sparse optimization problems. The analysis shows that the linearized Bregma...
Wotao Yin
ICCV
1995
IEEE
13 years 11 months ago
Locating Objects Using the Hausdorff Distance
The Hausdorff distance is a measure defined between two point sets, here representing a model and an image. The Hausdorff distance is reliable even when the image contains multipl...
William Rucklidge
MICRO
2003
IEEE
96views Hardware» more  MICRO 2003»
14 years 1 months ago
Scalable Hardware Memory Disambiguation for High ILP Processors
This paper describes several methods for improving the scalability of memory disambiguation hardware for future high ILP processors. As the number of in-flight instructions grows...
Simha Sethumadhavan, Rajagopalan Desikan, Doug Bur...