Sciweavers

1768 search results - page 220 / 354
» Optimal routing in Chord
Sort
View
101
Voted
ICASSP
2010
IEEE
15 years 1 months ago
Optimize the obvious: Automatic call flow generation
In commercial spoken dialog systems, call flows are built by call flow designers implementing a predefined business logic. While it may appear obvious from this logic how the c...
David Suendermann, Jackson Liscombe, Roberto Piera...
IJSNET
2006
217views more  IJSNET 2006»
15 years 1 months ago
Optimal sleep scheduling with transmission range assignment in application-specific wireless sensor networks
: To extend the functional lifetime of battery-operated Wireless Sensor Networks (WSNs), stringent sleep scheduling strategies with communication duty cycles running at sub-1% rang...
Rick W. Ha, Pin-Han Ho, Xuemin Shen
IJSN
2007
73views more  IJSN 2007»
15 years 1 months ago
Optimal worm-scanning method using vulnerable-host distributions
: Most Internet worms use random scanning. The distribution of vulnerable hosts on the Internet, however, is highly non-uniform over the IP-address space. This implies that random ...
Zesheng Chen, Chuanyi Ji
JSAC
2007
109views more  JSAC 2007»
15 years 1 months ago
Optimization of Semi-Dynamic Lightpath Rearrangements in a WDM Network
— In this paper, we study the Routing and Wavelength Assignment (RWA) problem in a semi-dynamic scenario where rearrangements are conducted in a series of sessions after traffic...
Yiming Zhang, Oliver W. W. Yang, Jing Wu, Michel S...
102
Voted
DSD
2009
IEEE
124views Hardware» more  DSD 2009»
15 years 8 months ago
Network-on-Chip Architecture Exploration Framework
— In this paper, we present a novel framework for the automated generation of Network-on-Chips (NoC) architectures, that enables architecture exploration and optimization. The au...
Timo Schönwald, Jochen Zimmermann, Oliver Bri...