1727 search results - page 143 / 346 » A Technique for Large Automated Mechanism Design Problems |
159
click to vote
ECAI
2000
Springer
15 years 11 months ago
2000
Springer
This paper proposes new algorithms for the Binate Covering Problem (BCP), a well-known restriction of Boolean Optimization. Binate Covering finds application in many areas of Com...
157
click to vote
DAC
2000
ACM
16 years 7 months ago
2000
ACM
eously demand shorter and less costly design cycles. Designing at higher levels of abstraction makes both objectives achievable, but enabling techniques like behavioral synthesis h...
149
click to vote
DAC
2004
ACM
16 years 7 months ago
2004
ACM
The growing number of instances of breaches in information security in the last few years has created a compelling case for efforts towards secure electronic systems. Embedded sys...
164
click to vote
ISQED
2007
IEEE
16 years 24 days ago
2007
IEEE
In high-level synthesis for FPGA designs, scheduling and chaining of operations for optimal performance remain challenging problems. In this paper, we present a balanced schedulin...
157
click to vote
CSCW
2002
ACM
15 years 6 months ago
2002
ACM
In this paper, we first describe a formative empirical study to inform the design of CSCW tools to support idea finding in co-located groups. Groups of students worked on creative...