Sciweavers

1157 search results - page 184 / 232
» Solving iterated functions using genetic programming
Sort
View
131
Voted
ICFP
1999
ACM
15 years 7 months ago
Type Inference Builds a Short Cut to Deforestation
Deforestation optimises a functional program by transforming it into another one that does not create certain intermediate data structures. Short cut deforestation is a deforestat...
Olaf Chitil
116
Voted
IWC
2000
94views more  IWC 2000»
15 years 3 months ago
Design and evaluation of the alignment stick
Object alignment is one of the basic operations in drawing programs. Current solutions provide mainly three ways for carrying out this operation: either by issuing an alignment co...
Roope Raisamo, Kari-Jouko Räihä
112
Voted
MP
2010
92views more  MP 2010»
14 years 10 months ago
Single item lot-sizing with non-decreasing capacities
We consider the single item lot-sizing problem with capacities that are non-decreasing over time. When the cost function is i) non-speculative or Wagner-Whitin (for instance, cons...
Yves Pochet, Laurence A. Wolsey
136
Voted
CASES
2003
ACM
15 years 8 months ago
Clustered calculation of worst-case execution times
Knowing the Worst-Case Execution Time (WCET) of a program is necessary when designing and verifying real-time systems. A correct WCET analysis method must take into account the po...
Andreas Ermedahl, Friedhelm Stappert, Jakob Engblo...
153
Voted

Publication
141views
14 years 1 months ago
Measures of Diversity for Populations and Distances Between Individuals with Highly Reorganizable Genomes
In this paper we address the problem of defining a measure of diversity for a population of individuals whose genome can be subjected to major reorganizations during the evolution...
Claudio Mattiussi, Markus Waibel, Dario Floreano