Sciweavers

2283 search results - page 271 / 457
» Bounds of Graph Characteristics
Sort
View
COMSNETS
2012
222views more  COMSNETS 2012»
12 years 4 months ago
Exploring the design space of social network-based Sybil defenses
—Recently, there has been significant research interest in leveraging social networks to defend against Sybil attacks. While much of this work may appear similar at first glanc...
Bimal Viswanath, Mainack Mondal, Allen Clement, Pe...
WADS
2009
Springer
226views Algorithms» more  WADS 2009»
14 years 2 months ago
Online Priority Steiner Tree Problems
Abstract. A central issue in the design of modern communication networks is the provision of Quality-of-Service (QoS) guarantees at the presence of heterogeneous users. For instanc...
Spyros Angelopoulos
AIPS
2010
13 years 9 months ago
Incrementally Solving STNs by Enforcing Partial Path Consistency
Efficient management and propagation of temporal constraints is important for temporal planning as well as for scheduling. During plan development, new events and temporal constra...
Léon Planken, Mathijs de Weerdt, Neil Yorke...
MMAS
2004
Springer
14 years 1 months ago
Quantitative Organizational Models for Large-Scale Agent Systems
Abstract. As the scale and scope of multi-agent systems grow, it becomes increasingly important to design and manage the manner in which the participants interact. The potential fo...
Bryan Horling, Victor R. Lesser
ICCAD
1996
IEEE
90views Hardware» more  ICCAD 1996»
14 years 13 days ago
A coloring approach to the structural diagnosis of interconnects
This paper presents a new approach for diagnosing stuck-at and short faults in interconnects whose layouts are known. This structural approach exploits dierent graph coloring and ...
Xiao-Tao Chen, Fabrizio Lombardi