Sciweavers

3591 search results - page 104 / 719
» Typing linear constraints
Sort
View
CSR
2007
Springer
15 years 4 months ago
Ruling Out Polynomial-Time Approximation Schemes for Hard Constraint Satisfaction Problems
The maximum constraint satisfaction problem (Max CSP) is the following computational problem: an instance is a finite collection of constraints on a set of variables, and the goal...
Peter Jonsson, Andrei A. Krokhin, Fredrik Kuivinen
IWSSD
2000
IEEE
15 years 2 months ago
Design Guidance through the Controlled Application of Constraints
We seek to facilitate development of high quality software designs and architectures by using rigorous process definitions to guide application of the complex structure of relati...
Aaron G. Cass, Leon J. Osterweil
CP
2003
Springer
15 years 3 months ago
An Algebraic Approach to Multi-sorted Constraints
Abstract. Most previous theoretical study of the complexity of the constraint satisfaction problem has considered a simplified version of the problem in which all variables have t...
Andrei A. Bulatov, Peter Jeavons
DATE
2000
IEEE
142views Hardware» more  DATE 2000»
15 years 2 months ago
Power and Delay Reduction via Simultaneous Logic and Placement Optimization in FPGAs
Traditional FPGA design flows have treated logic synthesis and physical design as separate steps. With the recent advances in technology, the lack of information on the physical ...
Balakrishna Kumthekar, Fabio Somenzi
ICTAC
2010
Springer
14 years 8 months ago
A Modality for Safe Resource Sharing and Code Reentrancy
Abstract. The potential of linear logic in facilitating reasoning on resource usage has long been recognized. However, convincing uses of linear types in practical programming are ...
Rui Shi, Dengping Zhu, Hongwei Xi