338 search results - page 40 / 68 » Automated Design and Programming of a Microfluidic DNA Compu... |
85
Voted
DAC
1999
ACM
15 years 10 months ago
1999
ACM
Finding the minimum column multiplicity for a bound set of variables is an important problem in Curtis decomposition. To investigate this problem, we compared two graphcoloring pr...
DAC
2000
ACM
15 years 10 months ago
2000
ACM
We propose practical iterated methods for layout density control for CMP uniformity, based on linear programming, Monte-Carlo and greedy algorithms. We experimentally study the tr...
88
Voted
LPAR
2004
Springer
15 years 3 months ago
2004
Springer
Abstract. To produce a program guaranteed to satisfy a given specification one can synthesize it from a formal constructive proof that a computation satisfying that specification...
83
Voted
JAIR
2006
14 years 9 months ago
2006
Efficient representations and solutions for large decision problems with continuous and discrete variables are among the most important challenges faced by the designers of automa...
ASPLOS
2011
ACM
14 years 1 months ago
2011
ACM
Reducing the energy footprint of data centers continues to receive significant attention due to both its financial and environmental impact. There are numerous methods that limi...