Sciweavers

3001 search results - page 117 / 601
» Recursive type generativity
Sort
View
ENDM
2002
113views more  ENDM 2002»
15 years 4 months ago
On robust cycle bases
Two types of robust cycle bases are defined via recursively nice arrangements; complete and bipartite complete graphs are shown to have such bases. It is shown that a diagram in a...
Paul C. Kainen
MICRO
2012
IEEE
285views Hardware» more  MICRO 2012»
13 years 7 months ago
Automatic Extraction of Coarse-Grained Data-Flow Threads from Imperative Programs
This article presents a general algorithm for transforming sequential imperative programs into parallel data-flow programs. Our algorithm operates on a program dependence graph i...
Feng Li, Antoniu Pop, Albert Cohen
126
Voted
GECCO
2005
Springer
142views Optimization» more  GECCO 2005»
15 years 10 months ago
Choreogenetics: the generation of choreographic variants through genetic mutations and selection
In this paper, a genetic algorithm is introduced to generate variants of a choreographic sequence, which are then selected using different criteria. The mutation phase of the algo...
François-Joseph Lapointe
IMR
2005
Springer
15 years 10 months ago
Marching Generation of Smooth Structured and Hybrid Meshes Based on Metric Identity
Elliptic differential equations are derived for the generation of structured meshes and difference equations for the generation of smooth hybrid meshes from metric identity. A par...
Jochen Wild, Peter Niederdrenk, Thomas Gerhold
ITP
2010
164views Mathematics» more  ITP 2010»
15 years 9 months ago
Nitpick: A Counterexample Generator for Higher-Order Logic Based on a Relational Model Finder
Nitpick is a counterexample generator for Isabelle/HOL that builds on Kodkod, a SAT-based first-order relational model finder. Nitpick supports unbounded quantification, (co)ind...
Jasmin Christian Blanchette, Tobias Nipkow