Sciweavers

597 search results - page 90 / 120
» Combinatorial Models for Cooperation Networks
Sort
View
DSN
2006
IEEE
14 years 3 months ago
The Startup Problem in Fault-Tolerant Time-Triggered Communication
Fault-tolerant time-triggered communication relies on the synchronization of local clocks. The startup problem is the problem of reaching a sufficient degree of synchronization a...
Wilfried Steiner, Hermann Kopetz
IUI
2005
ACM
14 years 2 months ago
Generating semantic contexts from spoken conversation in meetings
SemanticTalk is a tool for supporting face-to-face meetings and discussions by automatically generating a semantic context from spoken conversations. We use speech recognition and...
Jürgen Ziegler, Zoulfa El Jerroudi, Karsten B...
AINA
2010
IEEE
14 years 2 months ago
Lightweight Policy-Based Management of Quality-Assured, Device-Based Service Systems
Intelligent connected devices become a more vital part of our lives. In contrast to prior years, today embedded systems and devices are loosely coupled and cooperate with each oth...
Oliver Dohndorf, Jan Krüger, Heiko Krumm, Chr...
IOR
2007
89views more  IOR 2007»
13 years 9 months ago
Fast, Fair, and Efficient Flows in Networks
Abstract. We study the problem of minimizing the maximum latency of flows in networks with congestion. We show that this problem is NP-hard, even when all arc latency functions ar...
José R. Correa, Andreas S. Schulz, Nicol&aa...
ICALP
2005
Springer
14 years 2 months ago
On the Wake-Up Problem in Radio Networks
Abstract. Radio networks model wireless communication when processing units communicate using one wave frequency. This is captured by the property that multiple messages arriving s...
Bogdan S. Chlebus, Leszek Gasieniec, Dariusz R. Ko...