Sciweavers

3250 search results - page 280 / 650
» An Algorithm to Solve a Linear Program
Sort
View
IEEEPACT
2006
IEEE
16 years 19 days ago
Program generation for the all-pairs shortest path problem
A recent trend in computing are domain-specific program generators, designed to alleviate the effort of porting and reoptimizing libraries for fast-changing and increasingly com...
Sung-Chul Han, Franz Franchetti, Markus Püsch...
ICFP
2003
ACM
16 years 6 months ago
An extension of HM(X) with bounded existential and universal data-types
We propose a conservative extension of HM(X), a generic constraint-based type inference framework, with bounded existential (a.k.a. abstract) and universal (a.k.a. polymorphic) da...
Vincent Simonet
EC
2008
153views ECommerce» more  EC 2008»
15 years 6 months ago
On Complexity of Optimal Recombination for Binary Representations of Solutions
We consider an optimization problem of finding the best possible offspring as a result of a recombination operator in an evolutionary algorithm, given two parent solutions. The op...
Anton V. Eremeev
ENTCS
2010
96views more  ENTCS 2010»
15 years 4 months ago
Programming in Biomolecular Computation
Our goal is to provide a top-down approach to biomolecular computation. In spite of widespread discussion about connections between biology and computation, one question seems not...
Lars Hartmann, Neil D. Jones, Jakob Grue Simonsen
GECCO
2006
Springer
262views Optimization» more  GECCO 2006»
15 years 10 months ago
Genetically programmed strategies for chess endgame
Classical chess engines exhaustively explore moving possibilities from a chessboard configuration to choose what the next best move to play is. In this article we present a new me...
Nicolas Lassabe, Stéphane Sanchez, Herv&eac...