600 search results - page 69 / 120 » Solving Distributed Constraint Optimization Problems Using L... |
101
Voted
CCCG
2010
15 years 16 days ago
2010
We investigate experimentally the Domatic Partition (DP) problem, the Independent Domatic Partition (IDP) problem and the Idomatic partition problem in Random Geometric Graphs (RG...
FPGA
1997
ACM
15 years 3 months ago
1997
ACM
We present a general approach to the FPGA technology mapping problem that applies to any logic block composed of lookup tables LUTs and can yield optimal solutions. The connecti...
104
click to vote
EUROPAR
2006
Springer
15 years 2 months ago
2006
Springer
Computations on two-dimensional arrays such as matrices and images are one of the most fundamental and ubiquitous things in computational science and its vast application areas, bu...
DAC
2005
ACM
16 years 1 days ago
2005
ACM
We present an efficient optimization scheme for gate sizing in the presence of process variations. Using a posynomial delay model, the delay constraints are modified to incorporat...
CPAIOR
2010
Springer
15 years 2 months ago
2010
Springer
Cutting plane methods are widely used for solving convex optimization problems and are of fundamental importance, e.g., to provide tight bounds for Mixed-Integer Programs (MIPs). T...