Sciweavers

5864 search results - page 139 / 1173
» Can We Work around Numerical Methods
Sort
View
CAV
1999
Springer
104views Hardware» more  CAV 1999»
15 years 8 months ago
On the Representation of Probabilities over Structured Domains
Abstract. In this paper we extend one of the main tools used in veri cation of discrete systems, namely Binary Decision Diagrams (BDD), to treat probabilistic transition systems. W...
Marius Bozga, Oded Maler
GECCO
2007
Springer
192views Optimization» more  GECCO 2007»
15 years 10 months ago
Convergence of stochastic search algorithms to gap-free pareto front approximations
Recently, a convergence proof of stochastic search algorithms toward finite size Pareto set approximations of continuous multi-objective optimization problems has been given. The...
Oliver Schütze, Marco Laumanns, Emilia Tantar...
PLDI
1997
ACM
15 years 8 months ago
Incremental Analysis of real Programming Languages
A major research goal for compilers and environments is the automatic derivation of tools from formal specifications. However, the formal model of the language is often inadequat...
Tim A. Wagner, Susan L. Graham
SACRYPT
2007
Springer
15 years 10 months ago
Two Trivial Attacks on Trivium
Trivium is a stream cipher designed in 2005 by C. De Canni`ere and B. Preneel for the European project eSTREAM. It has successfully passed the first phase of the project and has ...
Alexander Maximov, Alex Biryukov
CVPR
2003
IEEE
16 years 6 months ago
Shape Context and Chamfer Matching in Cluttered Scenes
This paper compares two methods for object localization from contours: shape context and chamfer matching of templates. In the light of our experiments, we suggest improvements to...
Arasanathan Thayananthan, Bjoern Stenger, Philip H...