56 search results - page 9 / 12 » Coalition Structure Generation with Worst Case Guarantees |
81
Voted
ECUMN
2007
Springer
15 years 4 months ago
2007
Springer
— Currently used IP routing protocols calculate and only use a single path between two nodes of a network, or in the best case, only paths with the same cost (with OSPF2 or IS-IS...
90
Voted
CODES
2007
IEEE
15 years 4 months ago
2007
IEEE
Caches are notorious for their unpredictability. It is difficult or even impossible to predict if a memory access results in a definite cache hit or miss. This unpredictability i...
DAC
2009
ACM
15 years 11 months ago
2009
ACM
Traditionally, synchronous languages, such as Esterel, have been compiled into hardware, where timing analysis is relatively easy. When compiled into software ? e.g., into sequent...
99
Voted
DCOSS
2006
Springer
15 years 2 months 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...
83
Voted
MOBIHOC
2007
ACM
15 years 10 months ago
2007
ACM
Recently, there has been substantial interest in the design of crosslayer protocols for wireless networks. These protocols optimize certain performance metric(s) of interest (e.g....