Sciweavers

945 search results - page 70 / 189
» Incremental Branching Programs
Sort
View
ICPPW
2003
IEEE
14 years 2 months ago
From Distributed Sequential Computing to Distributed Parallel Computing
One approach to distributed parallel programming is to utilize self-migrating threads. Computations can be distributed first, and parallelized second. The first step produces a ...
Lei Pan, Lubomir Bic, Michael B. Dillencourt, Ming...
GLVLSI
2000
IEEE
105views VLSI» more  GLVLSI 2000»
14 years 1 months ago
An evolutionary approach to timing driven FPGA placement
: We propose a novel evolutionary approach to the problem of timing-driven FPGA placement. The method used is evolutionary programming (EP) with incremental position encoded in the...
R. Venkatraman, Lalit M. Patnaik
SAS
2005
Springer
127views Formal Methods» more  SAS 2005»
14 years 2 months ago
Banshee: A Scalable Constraint-Based Analysis Toolkit
Abstract. We introduce Banshee, a toolkit for constructing constraintbased analyses. Banshee’s novel features include a code generator for creating customized constraint resoluti...
John Kodumal, Alexander Aiken
GECCO
2003
Springer
121views Optimization» more  GECCO 2003»
14 years 2 months ago
Evolving Hogg's Quantum Algorithm Using Linear-Tree GP
Intermediate measurements in quantum circuits compare to conditional branchings in programming languages. Due to this, quantum circuits have a natural linear-tree structure. In thi...
André Leier, Wolfgang Banzhaf
INFORMS
2006
87views more  INFORMS 2006»
13 years 9 months ago
Early Estimates of the Size of Branch-and-Bound Trees
This paper intends to show that the time needed to solve mixed integer programming problems by branch and bound can be roughly predicted early in the solution process. We construc...
Gérard Cornuéjols, Miroslav Karamano...