6409 search results - page 113 / 1282 » A Computational Algorithm for Origami Design |
196
click to vote
ISCAPDCS
2003
15 years 7 months ago
2003
The quick construction of the Shortest Path Tree (SPT) is essential to achieve fast routing speed for an interior network using link state protocols, such as OSPF and IS-IS. Whene...
174
click to vote
ESA
2004
Springer
15 years 11 months ago
2004
Springer
We introduce a problem directly inspired by its application to DWDM (dense wavelength division multiplexing) network design. We are given a set of demands to be carried over a netw...
153
click to vote
GLVLSI
2009
IEEE
2009
IEEE
On the complexity of graph cuboidal dual problems for 3-D floorplanning of integrated circuit design
16 years 1 months ago
This paper discusses the impact of migrating from 2-D to 3-D on floorplanning and placement. By looking at a basic formulation of graph cuboidal dual problem, we show that the 3-...
171
click to vote
BROADNETS
2004
IEEE
15 years 10 months ago
2004
IEEE
Display of continuous media using self-organizing ad hoc networks of wireless communication systems will potentially be used in a variety of applications. Example deployments migh...
178
click to vote
ICCAD
2003
IEEE
16 years 3 months ago
2003
IEEE
Symbolic image computation is the most fundamental computation in BDD-based sequential system optimization and formal verification. In this paper, we explore the use of over-appr...