Sciweavers

914 search results - page 60 / 183
» Branch and Bound on the Network Model
Sort
View
QEST
2006
IEEE
15 years 3 months ago
Modeling Fiber Delay Loops in an All Optical Switch
We analyze the effect of a few fiber delay loops on the number of deflections in an all optical packet switch. The switch is based on the ROMEO architecture developed by Alcatel...
Ana Busic, Mouad Ben Mamoun, Jean-Michel Fourneau
OPODIS
2007
14 years 11 months ago
Deterministic Communication in the Weak Sensor Model
In Sensor Networks, the lack of topology information and the availability of only one communication channel has led research work to the use of randomization to deal with collisio...
Antonio Fernández Anta, Miguel A. Mosteiro,...
JMLR
2008
159views more  JMLR 2008»
14 years 9 months ago
Near-Optimal Sensor Placements in Gaussian Processes: Theory, Efficient Algorithms and Empirical Studies
When monitoring spatial phenomena, which can often be modeled as Gaussian processes (GPs), choosing sensor locations is a fundamental task. There are several common strategies to ...
Andreas Krause, Ajit Paul Singh, Carlos Guestrin
IPPS
2006
IEEE
15 years 3 months ago
Modeling malware propagation in Gnutella type peer-to-peer networks
A key emerging and popular communication paradigm, primarily employed for information dissemination, is peer-to-peer (P2P) networking. In this paper, we model the spread of malwar...
Krishna K. Ramachandran, Biplab Sikdar
SWAT
2004
Springer
153views Algorithms» more  SWAT 2004»
15 years 3 months ago
Melding Priority Queues
We show that any priority queue data structure that supports insert, delete, and find-min operations in pq(n) time, when n is an upper bound on the number of elements in the prio...
Ran Mendelson, Robert Endre Tarjan, Mikkel Thorup,...