867 search results - page 108 / 174 » An Evolutionary Algorithm for Integer Programming |
125
click to vote
GECCO
2009
Springer
15 years 11 months ago
2009
Springer
This work provides an analysis of using the evolutionary algorithm EPNet to create ensembles of artificial neural networks to solve a range of forecasting tasks. Several previous...
123
click to vote
SAS
2007
Springer
15 years 10 months ago
2007
Springer
Abstract. Shape analyses are often imprecise in their numerical reasoning, whereas numerical static analyses are often largely unaware of the shape of a program’s heap. In this p...
123
click to vote
COCO
2005
Springer
15 years 10 months ago
2005
Springer
It is well known that the hardest bit of integer multiplication is the middle bit, i.e. MULn−1,n. This paper contains several new results on its complexity. First, the size s of...
169
Voted
SIGSOFT
2007
ACM
16 years 5 months ago
2007
ACM
We present an approach for checking code against rich specifications, based on existing work that consists of encoding the program in a relational logic and using a constraint sol...
183
click to vote
CP
2003
Springer
15 years 10 months ago
2003
Springer
Multiple sequence alignment is a central problem in Bioinformatics. A known integer programming approach is to apply branch-and-cut to exponentially large graph-theoretic models. T...