1609 search results - page 52 / 322 » Problem Structure and Dependable Architecture |
PODC
2009
ACM
14 years 11 months ago
2009
ACM
The paper presents distributed and parallel -approximation algorithms for covering problems, where is the maximum number of variables on which any constraint depends (for example...
DAC
1996
ACM
14 years 3 months ago
1996
ACM
In this paper, we study the problem of decomposing gates in fanin-unbounded or K-bounded networks such that the K-input LUT mapping solutions computed by a depthoptimal mapper hav...
CORR
2010
Springer
13 years 11 months ago
2010
Springer
Software development is rarely an individual effort and generally involves teams of developers collaborating to generate good reliable code. Among the software code there exist te...
COR
2007
13 years 11 months ago
2007
In this paper we present an ant-based algorithm for solving unconstrained multi-level lot-sizing problems called ant system for multi-level lot-sizing algorithm (ASMLLS). We apply...
ICCAD
2005
IEEE
14 years 8 months ago
2005
IEEE
Technology mapping based on DAG-covering suffers from the problem of structural bias: the structure of the mapped netlist depends strongly on the subject graph. In this paper we ...