Sciweavers

1054 search results - page 148 / 211
» Capacitated Domination Problem
Sort
View
WEA
2004
Springer
124views Algorithms» more  WEA 2004»
15 years 4 months ago
Experimental Studies of Symbolic Shortest-Path Algorithms
Abstract. Graphs can be represented symbolically by the Ordered Binary Decision Diagram (OBDD) of their characteristic function. To solve problems in such implicitly given graphs, ...
Daniel Sawitzki
ISCC
2003
IEEE
152views Communications» more  ISCC 2003»
15 years 4 months ago
Dynamic Fair Queuing (DFQ): A Novel Fair Scheduler Improving Wireless Transmission over Hybrid LANs
Local area network (LAN) will be a hybrid network that includes wired and wireless links together. Nonetheless, the wired hosts always take the most bandwidth and bring about the ...
Ce-Kuen Shieh, Yu-Ben Miao, Ming-Qi Shieh, Wen-Shy...
ICCAD
2002
IEEE
126views Hardware» more  ICCAD 2002»
15 years 4 months ago
Robust and passive model order reduction for circuits containing susceptance elements
Numerous approaches have been proposed to address the overwhelming modeling problems that result from the emergence of magnetic coupling as a dominant performance factor for ICs a...
Hui Zheng, Lawrence T. Pileggi
HICSS
2000
IEEE
134views Biometrics» more  HICSS 2000»
15 years 3 months ago
Peer-to-Peer Valuation as a Mechanism for Reinforcing Active Learning in Virtual Communities: Actualizing Social Exchange Theory
As knowledge becomes the primary focus of work in many industries, virtual communities and groups are emerging as part of new organizational forms. Within these virtual forms, eff...
Amrit Tiwana, Ashley A. Bush
DAC
1999
ACM
15 years 3 months ago
Exact Memory Size Estimation for Array Computations without Loop Unrolling
This paper presents a new algorithm for exact estimation of the minimum memory size required by programs dealing with array computations. Memory size is an important factor a ecti...
Ying Zhao, Sharad Malik