Results 1 to 10 of about 1,071 (86)
Combinatorial Route to Algebra: The Art of Composition & Decomposition [PDF]
Discrete Mathematics & Theoretical Computer Science, 2009 We consider a general concept of composition and decomposition of objects, and discuss a few natural properties one may expect from a reasonable choice thereof.
Pawel Blasiak
doaj +1 more source
Oriented Multicast Routing Applied to Network Level Agent Search [PDF]
Discrete Mathematics & Theoretical Computer Science, 2001 Many protocols need a discovery mechanism to enable a given node to locate one or several nodes involved in the same communication. However, there is no protocol ready to fulfill this service at the network-layer.
Damien Magoni, Jean-Jacques Pansiot
doaj +1 more source
Non Unitary Random Walks [PDF]
Discrete Mathematics & Theoretical Computer Science, 2009 Motivated by the recent refutation of information loss paradox in black hole by Hawking, we investigate the new concept of {\it non unitary random walks}.
Philippe Jacquet
doaj +1 more source
Combinatorial optimization in networks with Shared Risk Link Groups [PDF]
Discrete Mathematics & Theoretical Computer Science, 2016 The notion of Shared Risk Link Groups (SRLG) captures survivability issues when a set of links of a network may fail simultaneously. The theory of survivable network design relies on basic combinatorial objects that are rather easy to compute in the ...
David Coudert +3 more
doaj +1 more source
Robust Wireless Sensor Network Deployment [PDF]
Discrete Mathematics & Theoretical Computer Science, 2016 In this work we present a decentralized deployment algorithm for wireless mobile sensor networks focused on deployment Efficiency, connectivity Maintenance and network Reparation (EMR).
Milan Erdelj +2 more
doaj +1 more source
Self-Stabilizing Disconnected Components Detection and Rooted Shortest-Path Tree Maintenance in Polynomial Steps [PDF]
Discrete Mathematics & Theoretical Computer Science, 2017 We deal with the problem of maintaining a shortest-path tree rooted at some process r in a network that may be disconnected after topological changes. The goal is then to maintain a shortest-path tree rooted at r in its connected component, V_r, and make
Stéphane Devismes +2 more
doaj +1 more source
Linear time recognition of P4-indifference graphs [PDF]
Discrete Mathematics & Theoretical Computer Science, 2001 A graph is a P4-indifference graph if it admits an ordering < on its vertices such that every chordless path with vertices a, b, c, d and edges ab, bc, cd has ...
Michel Habib +2 more
doaj +1 more source
Content Based Traffic Engineering in Software Defined Information Centric Networks [PDF]
, 2013 This paper describes a content centric network architecture which uses software defined networking principles to implement efficient metadata driven services by extracting content metadata at the network layer.
Chanda, Abhishek +2 more
core +1 more source
A New Hybrid Method of IPv6 Addressing in the Internet of Things
, 2020 Humans have always been seeking greater control over their surrounding objects. Today, with the help of Internet of Things (IoT), we can fulfill this goal.
Imani, Mehdi +3 more
core +1 more source
Knowledge hubs and knowledge clusters: Designing a knowledge architecture for development. [PDF]
, 2008 With globalisation and knowledge-based production, firms may cooperate on a global scale, outsource parts of their administrative or productive units and negate location altogether.
Hans-Dieter, Evers +2 more
core +1 more source