Sciweavers

3250 search results - page 357 / 650
» An Algorithm to Solve a Linear Program
Sort
View
ICCAD
1999
IEEE
99views Hardware» more  ICCAD 1999»
15 years 11 months ago
Concurrent logic restructuring and placement for timing closure
: In this paper, an algorithm for simultaneous logic restructuring and placement is presented. This algorithm first constructs a set of super-cells along the critical paths and the...
Jinan Lou, Wei Chen, Massoud Pedram
PPSN
1998
Springer
15 years 11 months ago
Methods to Evolve Legal Phenotypes
Many optimization problems require the satisfaction of constraints in addition to their objectives. When using an evolutionary algorithm to solve such problems, these constraints c...
Tina Yu, Peter J. Bentley
SFP
2000
15 years 8 months ago
Detecting common elements of types
: We describe an algorithm approximatingthe following question: Given two types t1 and t2, are there instances (t1) and (t2) denoting a common element? By answering this question w...
Manfred Widera, Christoph Beierle
ACTA
2007
88views more  ACTA 2007»
15 years 6 months ago
Distributed Consensus, revisited
We provide a novel model to formalize a well-known algorithm, by Chandra and Toueg, that solves Consensus among asynchronous distributed processes in the presence of a particular ...
Rachele Fuzzati, Massimo Merro, Uwe Nestmann
FAW
2007
Springer
177views Algorithms» more  FAW 2007»
16 years 25 days ago
The Parameterized Complexity of the Induced Matching Problem in Planar Graphs
Abstract. Given a graph G and a nonnegative integer k, the NP-complete Induced Matching problem asks for an edge subset M such that M is a matching and no two edges of M are joined...
Hannes Moser, Somnath Sikdar