936 search results - page 64 / 188 » The Synthesis Problem of Netcharts |
129
click to vote
DAC
1994
ACM
15 years 7 months ago
1994
ACM
Abstract -- This paper describes a new memory estimation technique for DSP applications written in an applicative language. Since no concept of storage is present in an applicative...
139
Voted
FSEN
2009
Springer
15 years 7 months ago
2009
Springer
This note aims at providing a concise and precise Travellers Guide, Phrase Book or Reference Manual to the timed automata modeling formalism introduced by Alur and Dill [7, 8]. The...
129
Voted
IPCO
2001
15 years 5 months ago
2001
We investigate network design under volatile conditions of link failures and traffic overload. Our model is a non-simultaneous 2-commodity problem. We characterize the feasible so...
113
click to vote
DAC
2009
ACM
16 years 4 months ago
2009
ACM
Don't-care conditions provide additional flexibility in logic synthesis and optimization. However, most work only focuses on the gate level because it is difficult to handle ...
128
Voted
SIGSOFT
2008
ACM
16 years 4 months ago
2008
ACM
Synthesis of system configurations from a given set of features is an important and very challenging problem. This paper makes a step towards this goal by describing an efficient ...