Sciweavers

263 search results - page 10 / 53
» Do we teach the right algorithm design techniques
Sort
View
EURODAC
1994
IEEE
186views VHDL» more  EURODAC 1994»
13 years 11 months ago
Algorithms for a switch module routing problem
We consider a switch module routing problem for symmetric array FPGAs. The work is motivated by two applications. The rst is that of eciently evaluating switch module designs [8]...
Shashidhar Thakur, D. F. Wong, S. Muthukrishnan
ICCAD
1994
IEEE
65views Hardware» more  ICCAD 1994»
13 years 11 months ago
Incremental formal design verification
Language containment is a method for design verification that involves checking if the behavior of the system to be verified is a subset of the behavior of the specifications (pro...
Gitanjali Swamy, Robert K. Brayton
ICALP
2010
Springer
14 years 6 days ago
Network Design via Core Detouring for Problems without a Core
Some of the currently best-known approximation algorithms for network design are based on random sampling. One of the key steps of such algorithms is connecting a set of source nod...
Fabrizio Grandoni, Thomas Rothvoß
ICIP
2003
IEEE
14 years 9 months ago
Rate distortion optimized mode decision in the scalable video coding
In this paper, we discuss how to apply the rate distortion technique to select the optimal mode in the scalable coding. Firstly, we analyze this problem from a general scalable mo...
Zhijie Yang, Feng Wu, Shipeng Li
INFOCOM
1991
IEEE
13 years 11 months ago
On Multicast Path Finding Algorithms
We have designed and implemented three multicast path finding algorithms for networks with directed links: an optimal algorithm based on the dynamic programming technique, a heuri...
Ching-Hua Chow