Sciweavers

307 search results - page 45 / 62
» Finite locally-quasiprimitive graphs
Sort
View
MOBIHOC
2007
ACM
14 years 9 months ago
Approximation algorithms for longest-lived directional multicast communications in WANETs
Several centralized and distributed algorithms have been recently proposed to maximize the multicast lifetime for directional communications in wireless ad-hoc networks. Their per...
Song Guo, Oliver W. W. Yang, Victor C. M. Leung
WCNC
2010
IEEE
14 years 1 months ago
Node Connectivity Analysis in Multi-Hop Wireless Networks
—In this paper, we study node connectivity in multi-hop wireless networks. Nodal degree of connectivity as one of the fundamental graph properties is the basis for the study of n...
Bahador Bakhshi, Siavash Khorsandi
EUSFLAT
2003
161views Fuzzy Logic» more  EUSFLAT 2003»
13 years 11 months ago
Fuzzy interpolation and level 2 gradual rules
Functional laws may be known only at a finite number of points, and then the function can be completed by interpolation techniques obeying some smoothness conditions. We rather pr...
Sylvie Galichet, Didier Dubois, Henri Prade
GG
2010
Springer
13 years 11 months ago
Local Confluence for Rules with Nested Application Conditions
Abstract. Local confluence is an important property in many rewriting and transformation systems. The notion of critical pairs is central for being able to verify local confluence ...
Hartmut Ehrig, Annegret Habel, Leen Lambers, Ferna...
CORR
2010
Springer
122views Education» more  CORR 2010»
13 years 10 months ago
How to meet asynchronously (almost) everywhere
Two mobile agents (robots) with distinct labels have to meet in an arbitrary, possibly infinite, unknown connected graph or in an unknown connected terrain in the plane. Agents ar...
Jurek Czyzowicz, Arnaud Labourel, Andrzej Pelc