Sciweavers

2430 search results - page 388 / 486
» Computing Tutte Polynomials
Sort
View
160
Voted
QEST
2008
IEEE
15 years 9 months ago
Approximate Analysis of Probabilistic Processes: Logic, Simulation and Games
We tackle the problem of non robustness of simulation and bisimulation when dealing with probabilistic processes. It is important to ignore tiny deviations in probabilities becaus...
Josée Desharnais, François Laviolett...
RSP
2008
IEEE
118views Control Systems» more  RSP 2008»
15 years 9 months ago
Functional DIF for Rapid Prototyping
Dataflow formalisms have provided designers of digital signal processing systems with optimizations and guarantees to arrive at quality prototypes quickly. As system complexity in...
William Plishker, Nimish Sane, Mary Kiemb, Kapil A...
112
Voted
WCNC
2008
IEEE
15 years 9 months ago
Connectivity-Aware Network Maintenance via Relays Deployment
— In this paper, we address the network maintenance problem, in which we aim to maximize the lifetime of a sensor network by adding a set of relays to it. The network lifetime is...
Ahmed S. Ibrahim, Karim G. Seddik, K. J. Ray Liu
ADHOCNOW
2008
Springer
15 years 9 months ago
Novel Algorithms for the Network Lifetime Problem in Wireless Settings
Abstract. A wireless ad-hoc network is a collection of transceivers positioned in the plane. Each transceiver is equipped with a limited, nonreplenishable battery charge. The batte...
Michael Elkin, Yuval Lando, Zeev Nutov, Michael Se...
ADHOCNOW
2008
Springer
15 years 9 months ago
Request Satisfaction Problem in Synchronous Radio Networks
We study two algorithmical problems inspired from routing constraints in a multihop synchronous radio network. Our objective is to satisfy a given set of communication requests in ...
Benoît Darties, Sylvain Durand, Jér&o...