2497 search results - page 230 / 500 » Requirements for models of achievable routing |
143
click to vote
ICCAD
1999
IEEE
15 years 11 months ago
1999
IEEE
We present LEOPARD, a fanout optimization algorithm based on the effort delay model for near-continuous size buffer libraries. Our algorithm minimizes area under required timing a...
140
Voted
ISCAS
1999
IEEE
15 years 11 months ago
1999
IEEE
Radix-r modulo rn multipliers and adders are introduced in this paper. The proposed architectures are shown to require several times less area than previously reported architectur...
150
click to vote
TACS
1991
Springer
15 years 10 months ago
1991
Springer
We aim at a unified and coherent presentation of net models for concurrency like Petri nets and dataflow networks from the perspective of modularity and substitutivity. The major ...
121
click to vote
WSCG
2001
15 years 8 months ago
2001
the problem of locating services in a given context requires a methematical abstraction so that its complexity can be managed by means of an iterative search through context simul...
202
click to vote
WICSA
2007
15 years 7 months ago
2007
The software architecture is one of the most important artifacts created in the lifecycle of a software system. It enables, facilitates, hampers, or interferes directly the achiev...