458 search results - page 39 / 92 » Optimal Conclusive Sets for Comparator Networks |
DCOSS
2006
Springer
14 years 20 days ago
2006
Springer
Abstract. Today, there exist many algorithms and protocols for constructing agregation or dissemination trees for wireless sensor networks that are optimal (for different notions o...
IWCMC
2010
ACM
13 years 11 months ago
2010
ACM
We consider the problem of control traffic overhead in MANETs with long-lived connections, operating under a reactive routing protocol (e.g. AODV). In such settings, control traff...
GECCO
2007
Springer
14 years 3 months ago
2007
Springer
A survey of niching algorithms, based on 5 variants of derandomized Evolution Strategies (ES), is introduced. This set of niching algorithms, ranging from the very first derandom...
INFOCOM
2009
IEEE
14 years 3 months ago
2009
IEEE
—Network coding is a method that promises to achieve the min-cut capacity in multicasts. However, pushing towards this gain in throughput comes with two sacrifices. Delay suffer...
COCOA
2008
Springer
13 years 10 months ago
2008
Springer
Abstract. We consider a survivable network design problem known as the 2-NodeConnected Steiner Network Problem (2NCON): we are given a weighted undirected graph with a node partiti...