Sciweavers

10792 search results - page 1883 / 2159
» An Evaluation of Non-Equijoin Algorithms
Sort
View
ISSTA
2010
ACM
15 years 8 months ago
Exploiting program dependencies for scalable multiple-path symbolic execution
This paper presents a new technique, called Symbolic Program Decomposition (or SPD), for symbolic execution of multiple paths that is more scalable than existing techniques, which...
Raúl A. Santelices, Mary Jean Harrold
CEC
2008
IEEE
15 years 8 months ago
Directed trees: A powerful representation for sorting and ordering problems
We present a simple framework for dealing with search spaces consisting of permutations. To demonstrate its usefulness, we build upon it a simple (1 + 1)-evolutionary algorithm fo...
Benjamin Doerr, Edda Happ
CHES
2008
Springer
146views Cryptology» more  CHES 2008»
15 years 8 months ago
Power and Fault Analysis Resistance in Hardware through Dynamic Reconfiguration
Dynamically reconfigurable systems are known to have many advantages such as area and power reduction. The drawbacks of these systems are the reconfiguration delay and the overhead...
Nele Mentens, Benedikt Gierlichs, Ingrid Verbauwhe...
CHI
2008
ACM
15 years 8 months ago
Escape: a target selection technique using visually-cued gestures
Many mobile devices have touch-sensitive screens that people interact with using fingers or thumbs. However, such interaction is difficult because targets become occluded, and bec...
Koji Yatani, Kurt Partridge, Marshall W. Bern, Mar...
MMB
2010
Springer
185views Communications» more  MMB 2010»
15 years 8 months ago
Correctness Issues of Symbolic Bisimulation Computation for Markov Chains
Abstract. Bisimulation reduction is a classical means to fight the infamous state space explosion problem, which limits the applicability of automated methods for verification li...
Ralf Wimmer, Bernd Becker
« Prev « First page 1883 / 2159 Last » Next »