Sciweavers

2905 search results - page 376 / 581
» Formal Memetic Algorithms
Sort
View
OOPSLA
2010
Springer
15 years 2 months ago
Random testing for higher-order, stateful programs
Testing is among the most effective tools available for finding bugs. Still, we know of no automatic technique for generating test cases that expose bugs involving a combination ...
Casey Klein, Matthew Flatt, Robert Bruce Findler
SAS
2010
Springer
140views Formal Methods» more  SAS 2010»
15 years 2 months ago
Multi-dimensional Rankings, Program Termination, and Complexity Bounds of Flowchart Programs
Abstract. Proving the termination of a flowchart program can be done by exhibiting a ranking function, i.e., a function from the program states to a wellfounded set, which strictl...
Christophe Alias, Alain Darte, Paul Feautrier, Lau...
LCTRTS
2010
Springer
15 years 2 months ago
Translating concurrent action oriented specifications to synchronous guarded actions
Concurrent Action-Oriented Specifications (CAOS) model the behavior of a synchronous hardware circuit as asynchronous guarded at an abstraction level higher than the Register Tran...
Jens Brandt, Klaus Schneider, Sandeep K. Shukla
CVPR
2006
IEEE
16 years 6 months ago
Dynamics Based Robust Motion Segmentation
In this paper we consider the problem of segmenting multiple rigid motions using multi?frame point correspondence data. The main idea of the method is to group points according to...
Roberto Lublinerman, Mario Sznaier, Octavia I. Cam...
ICCV
2007
IEEE
16 years 6 months ago
Articulated Shape Matching by Robust Alignment of Embedded Representations
In this paper we propose a general framework to solve the articulated shape matching problem, formulated as finding point-to-point correspondences between two shapes represented b...
Diana Mateus, Fabio Cuzzolin, Radu Horaud, Edmond ...