4117 search results - page 24 / 824 » On the Satisfiability of Complex Constraints |
70
Voted
WMCSA
2002
IEEE
15 years 2 months ago
2002
IEEE
Applications running on a mobile and wireless devices must be able to adapt gracefully to limited and fluctuating network resources. The variety of applications, platforms upon w...
ICCAD
1999
IEEE
15 years 1 months ago
1999
IEEE
This paper describes a polynomial time algorithm for min-area retiming for edge-triggered circuits to handle both setup and hold constraints. Given a circuit G and a target clock ...
SAT
2010
Springer
14 years 7 months ago
2010
Springer
Abstract. The past few years have seen significant progress in algorithms and heuristics for both SAT and symmetry detection. Additionally, the thesis that some of SAT's intra...
AIR
2004
14 years 9 months ago
2004
Ensuring truthfulness amongst self-interested agents bidding against one another in an auction can be computationally expensive when prices are determined using the Vickrey-Clarke-...
AAIM
2005
Springer
14 years 11 months ago
2005
Springer
In this paper, we study how to, given a set of pre-routed requests in an all-optical network and a set of wavelengths available on each link, assign a subset of requests with maxim...