Sciweavers

1813 search results - page 209 / 363
» Instance Pruning Techniques
Sort
View
CP
2003
Springer
15 years 11 months ago
Using Constraint Programming to Solve the Maximum Clique Problem
This paper aims to show that Constraint Programming can be an efficient technique to solve a well-known combinatorial optimization problem: the search for a maximum clique in a gra...
Jean-Charles Régin
ESA
2003
Springer
90views Algorithms» more  ESA 2003»
15 years 11 months ago
Packing a Trunk
We report on a project with a German car manufacturer. The task is to compute (approximate) solutions to a specific large-scale packing problem. Given a polyhedral model of a car ...
Friedrich Eisenbrand, Stefan Funke, Joachim Reiche...
GECCO
2003
Springer
120views Optimization» more  GECCO 2003»
15 years 11 months ago
Multi-FPGA Systems Synthesis by Means of Evolutionary Computation
Abstract. Multi-FPGA systems (MFS) are used for a great variety of applications, for instance, dynamically re-configurable hardware applications, digital circuit emulation, and num...
José Ignacio Hidalgo, Francisco Ferná...
FCCM
2002
IEEE
208views VLSI» more  FCCM 2002»
15 years 11 months ago
The Effects of Datapath Placement and C-Slow Retiming on Three Computational Benchmarks
C-slow retiming (changing a design to support multiple instances of a computation) and datapath-aware placement have long been advocated by members of the FPGA synthesis community...
Nicholas Weaver, John Wawrzynek
SAC
2009
ACM
15 years 11 months ago
Automatic product derivation of multi-agent systems product lines
Multi-agent Systems (MASs) development and Software Product Lines (SPLs) are two consolidated software engineering techniques. Recent research work explores the integration betwee...
Elder Cirilo, Ingrid Nunes, Uirá Kulesza, C...