Sciweavers

2862 search results - page 260 / 573
» Bicriteria Network Design Problems
Sort
View
PEWASUN
2006
ACM
16 years 21 days ago
Revisiting neighbor discovery with interferences consideration
In wireless multi-hop networks, hello protocols for neighbor discovery are a basic service offered by the networking stack. However, their study usually rely on rather simplistic...
Elyes Ben Hamida, Guillaume Chelius, Eric Fleury
ICPPW
2002
IEEE
15 years 11 months ago
ARA - The Ant-Colony Based Routing Algorithm for MANETs
A mobile ad-hoc network (MANET) is a collection of mobile nodes which communicate over radio. These kind of networks are very flexible, thus they do not require any existing infr...
Mesut Günes, Udo Sorges, Imed Bouazizi
GECCO
2008
Springer
171views Optimization» more  GECCO 2008»
15 years 7 months ago
An EDA based on local markov property and gibbs sampling
The key ideas behind most of the recently proposed Markov networks based EDAs were to factorise the joint probability distribution in terms of the cliques in the undirected graph....
Siddhartha Shakya, Roberto Santana
DAC
2009
ACM
16 years 1 months ago
Clock skew optimization via wiresizing for timing sign-off covering all process corners
Manufacturing process variability impacts the performance of synchronous logic circuits by means of its effect on both clock network and functional block delays. Typically, varia...
Sari Onaissi, Khaled R. Heloue, Farid N. Najm
DSN
2008
IEEE
16 years 1 months ago
Probabilistic quorum systems in wireless ad hoc networks
Quorums are a basic construct in solving many fundamental distributed computing problems. One of the known ways of making quorums scalable and efficient is by weakening their int...
Roy Friedman, Gabriel Kliot, Chen Avin