Sciweavers

1805 search results - page 80 / 361
» Functional programming with structured graphs
Sort
View
SNPD
2003
14 years 3 days ago
Deductive and Inductive Methods for Program Synthesis
The paper discusses simple functional constraint networks and a value propagation method for program construction. Structural synthesis of programs is described as an example of d...
Jaan Penjam, Elena Sanko
WADS
2009
Springer
243views Algorithms» more  WADS 2009»
14 years 5 months ago
Resolving Loads with Positive Interior Stresses
We consider the pair (pi, fi) as a force with two-dimensional direction vector fi applied at the point pi in the plane. For a given set of forces we ask for a non-crossing geometri...
Günter Rote, André Schulz
ICDM
2002
IEEE
173views Data Mining» more  ICDM 2002»
14 years 3 months ago
Mining Genes in DNA Using GeneScout
In this paper, we present a new system, called GeneScout, for predicting gene structures in vertebrate genomic DNA. The system contains specially designed hidden Markov models (HM...
Michael M. Yin, Jason Tsong-Li Wang
ESOP
2010
Springer
14 years 8 months ago
Formal Verification of Coalescing Graph-Coloring Register Allocation
Iterated Register Coalescing (IRC) is a widely used heuristic for performing register allocation via graph coloring. Many implementations in existing compilers follow (more or less...
Andrew W. Appel, Benoît Robillard, Sandrine ...
ICES
2003
Springer
101views Hardware» more  ICES 2003»
14 years 4 months ago
A Developmental Method for Growing Graphs and Circuits
A review is given of approaches to growing neural networks and electronic circuits. A new method for growing graphs and circuits using a developmental process is discussed. The met...
Julian F. Miller, Peter Thomson