Sciweavers

5079 search results - page 991 / 1016
» Hidden-Action in Network Routing
Sort
View
FPGA
2003
ACM
154views FPGA» more  FPGA 2003»
15 years 3 months ago
Parallel placement for field-programmable gate arrays
Placement and routing are the most time-consuming processes in automatically synthesizing and configuring circuits for field-programmable gate arrays (FPGAs). In this paper, we ...
Pak K. Chan, Martine D. F. Schlag
ICTCS
2003
Springer
15 years 2 months ago
Cost Constrained Fixed Job Scheduling
In this paper, we study the problem of cost constrained fixed job scheduling (CCFJS). In this problem, there are a number of processors, each of which belongs to one of several cla...
Qiwei Huang, Errol L. Lloyd
COMPSAC
2002
IEEE
15 years 2 months ago
Personalized Redirection of Communication
Universal access to information and data is an important goal of current research. Previously different forms of information and data, captured by different devices or held on dif...
Yuping Yang, M. Howard Williams
FPL
2009
Springer
99views Hardware» more  FPL 2009»
15 years 2 months ago
Exploiting fast carry-chains of FPGAs for designing compressor trees
Fast carry chains featuring dedicated adder circuitry is a distinctive feature of modern FPGAs. The carry chains bypass the general routing network and are embedded in the logic b...
Hadi Parandeh-Afshar, Philip Brisk, Paolo Ienne
IWQOS
2001
Springer
15 years 2 months ago
Extending BGMP for Shared-Tree Inter-Domain QoS Multicast
QoS support poses new challenges to multicast routing especially for inter-domain multicast where network QoS characteristics will not be readily available as in intra-domain multi...
Aiguo Fei, Mario Gerla