Sciweavers

357 search results - page 17 / 72
» Fast Hypergraph Partition
Sort
View
DAGSTUHL
2006
13 years 9 months ago
On Complexity of Optimized Crossover for Binary Representations
We consider the computational complexity of producing the best possible offspring in a crossover, given two solutions of the parents. The crossover operators are studied on the cla...
Anton V. Eremeev
FMSD
2008
110views more  FMSD 2008»
13 years 7 months ago
Automatic symbolic compositional verification by learning assumptions
Abstract Compositional reasoning aims to improve scalability of verification tools by reducing the original verification task into subproblems. The simplification is typically base...
Wonhong Nam, P. Madhusudan, Rajeev Alur
ICCAD
1997
IEEE
90views Hardware» more  ICCAD 1997»
13 years 11 months ago
Transformational partitioning for co-design of multiprocessor systems
This paper presents the underlying methodology of Cosmos, an interactive approach for hardware software co-design capable of handling multiprocessor systems and distributed archit...
Gilberto Fernandes Marchioro, Jean-Marc Daveau, Ah...
IPPS
2003
IEEE
14 years 23 days ago
A GRASP-Based Algorithm for Solving DVE Partitioning Problem
Graphic cards performance increase and fast Internet connections are popularising Networked Virtual Environments. This immature paradigm of real-time applications has still to sol...
Pedro Morillo, Marcos Fernández
ISPD
2005
ACM
116views Hardware» more  ISPD 2005»
14 years 1 months ago
A fast algorithm for power grid design
This paper presents an efficient heuristic algorithm to design a power distribution network of a chip by employing a successive partitioning and grid refinement scheme. In an it...
Jaskirat Singh, Sachin S. Sapatnekar