Sciweavers

2663 search results - page 166 / 533
» How to Choose a Timing Model
Sort
View
APPROX
2010
Springer
179views Algorithms» more  APPROX 2010»
15 years 8 months ago
Rumor Spreading on Random Regular Graphs and Expanders
Broadcasting algorithms are important building blocks of distributed systems. In this work we investigate the typical performance of the classical and well-studied push model. Assu...
Nikolaos Fountoulakis, Konstantinos Panagiotou
CHI
2011
ACM
14 years 10 months ago
Competing online viewpoints and models of chronic illness
People with chronic health problems use online resources to understand and manage their condition, but many such resources can present competing and confusing viewpoints. We surve...
Jennifer Mankoff, Kateryna Kuksenok, Sara B. Kiesl...
MSWIM
2004
ACM
15 years 12 months ago
Exploring long lifetime routing (LLR) in ad hoc networks
In mobile ad hoc networks, node mobility causes links between nodes to break frequently, thus terminating the lifetime of the routes containing those links. An alternative route h...
Zhao Cheng, Wendi Beth Heinzelman
ECAI
2006
Springer
15 years 10 months ago
Modal Logics for Communicating Rule-Based Agents
In this paper, we show how to establish correctness and time bounds (e.g., quality of service guarantees) for multi-agent systems composed of communicating rule-based agents. The f...
Natasha Alechina, Mark Jago, Brian Logan
WWW
2006
ACM
16 years 7 months ago
Large-scale text categorization by batch mode active learning
Large-scale text categorization is an important research topic for Web data mining. One of the challenges in large-scale text categorization is how to reduce the amount of human e...
Steven C. H. Hoi, Rong Jin, Michael R. Lyu