Sciweavers

217 search results - page 29 / 44
» A new upper bound on the cyclic chromatic number
Sort
View
CORR
2009
Springer
114views Education» more  CORR 2009»
13 years 5 months ago
Distributed Branching Bisimulation Minimization by Inductive Signatures
We present a new distributed algorithm for state space minimization modulo branching bisimulation. Like its predecessor it uses signatures for refinement, but the refinement proce...
Stefan Blom, Jaco van de Pol
COMPGEOM
2010
ACM
14 years 19 days ago
On degrees in random triangulations of point sets
We study the expected number of interior vertices of degree i in a triangulation of a point set S, drawn uniformly at random from the set of all triangulations of S, and derive va...
Micha Sharir, Adam Sheffer, Emo Welzl
KI
2008
Springer
13 years 7 months ago
Shallow Models for Non-iterative Modal Logics
Abstract. Modal logics see a wide variety of applications in artificial intelligence, e.g. in reasoning about knowledge, belief, uncertainty, agency, defaults, and relevance. From ...
Lutz Schröder, Dirk Pattinson
GLOBECOM
2006
IEEE
14 years 1 months ago
Wormhole Attack in Wireless Ad Hoc Networks: Analysis and Countermeasure
— The wormhole attack is one of the most severe security attacks in wireless ad hoc networks. In this paper, we analyze the effect of the wormhole attack in shortest path routing...
Majid Khabbazian, Hugues Mercier, Vijay K. Bhargav...
ICTCS
2005
Springer
14 years 1 months ago
Faster Deterministic Wakeup in Multiple Access Channels
We consider the fundamental problem of waking up n processors sharing a multiple access channel. We assume the weakest model of synchronization, the locally synchronous model, in ...
Gianluca De Marco, Marco Pellegrini, Giovanni Sbur...