Sciweavers

269 search results - page 4 / 54
» Maximal Static Expansion
Sort
View
DIALM
2003
ACM
113views Algorithms» more  DIALM 2003»
14 years 19 days ago
Multicast time maximization in energy constrained wireless networks
We consider the problem of maximizing the lifetime of a given multicast connection in a wireless network of energyconstrained (e.g. battery-operated) nodes, by choosing ideal tran...
Patrik Floréen, Petteri Kaski, Jukka Kohone...
ACSD
2008
IEEE
107views Hardware» more  ACSD 2008»
13 years 9 months ago
Discrete real-time and stochastic-time process algebra for performance analysis of distributed systems
We present a process algebra with conditionally distributed discrete-time delays and generally-distributed stochastic delays. The treatment allows for expansion laws for the paral...
Jasen Markovski, Erik P. de Vink
IEICET
2006
77views more  IEICET 2006»
13 years 7 months ago
Efficient Scheduling for SDMG CIOQ Switches
ng problem for the SDMG CIOQ switch is abstracted as a bipartite k-matching problem. Using fluid model techniques, we prove that any maximal size k-matching algorithm on an SDMG CI...
Mei Yang, Si-Qing Zheng
ICCAD
2008
IEEE
125views Hardware» more  ICCAD 2008»
14 years 4 months ago
Practical, fast Monte Carlo statistical static timing analysis: why and how
Statistical static timing analysis (SSTA) has emerged as an essential tool for nanoscale designs. Monte Carlo methods are universally employed to validate the accuracy of the appr...
Amith Singhee, Sonia Singhal, Rob A. Rutenbar
CVPR
2007
IEEE
14 years 9 months ago
Fast, Approximately Optimal Solutions for Single and Dynamic MRFs
A new efficient MRF optimization algorithm, called FastPD, is proposed, which generalizes -expansion. One of its main advantages is that it offers a substantial speedup over that ...
Nikos Komodakis, Georgios Tziritas, Nikos Paragios