• Aucun résultat trouvé

[PDF] Top 20 Gathering asynchronous and oblivious robots on basic graph topologies under the Look -Compute-Move model

Has 10000 "Gathering asynchronous and oblivious robots on basic graph topologies under the Look -Compute-Move model" found on our website. Below are the top 20 most common "Gathering asynchronous and oblivious robots on basic graph topologies under the Look -Compute-Move model".

Gathering asynchronous and oblivious robots on basic graph topologies under the Look -Compute-Move model

Gathering asynchronous and oblivious robots on basic graph topologies under the Look -Compute-Move model

... on the capabilities of the robots as well as on the envi- ronment where they move, lead to very different ...of the work done during the recent years, it is enough to ... Voir le document complet

27

A unified approach for Gathering and Exclusive Searching on rings under weak assumptions

A unified approach for Gathering and Exclusive Searching on rings under weak assumptions

... for the robots. They are oblivious (without memory of the past), uniform (running the same deterministic algo- rithm), autonomous (without centralized control), anonymous (without ... Voir le document complet

38

Computing on rings by oblivious robots: a unified approach for different tasks

Computing on rings by oblivious robots: a unified approach for different tasks

... autonomous robots have to collaborate in order to accomplish a common task in a ring-topology where neither nodes nor edges are labeled (that is, the ring is ...problems: the exclusive perpetual ... Voir le document complet

37

How to gather asynchronous oblivious robots on anonymous rings

How to gather asynchronous oblivious robots on anonymous rings

... Work. The problem of let meet mobile entities on graphs [2, 11, 20] or open spaces [5, 10, 22] has been extensively studied in the last ...two robots are involved, the problem is referred to ... Voir le document complet

16

Gathering on Rings for Myopic Asynchronous Robots With Lights Sébastien Tixeuil

Gathering on Rings for Myopic Asynchronous Robots With Lights Sébastien Tixeuil

... mobile robots coordination has been conducted by the distributed computing ...community. The common goal of these research is to clarify the minimum capabilities for robots to achieve a ... Voir le document complet

18

Gathering and Exclusive Searching on Rings under Minimal Assumptions

Gathering and Exclusive Searching on Rings under Minimal Assumptions

... The asynchronous Look-Compute-Move model, also called CORDA, has first been defined in continuous environment [18, ...27]. The inaccuracy of the sensors used by ... Voir le document complet

16

Cluster-Directed Acyclic Graph Formation for IEEE 802.15.4 in Multihop Topologies

Cluster-Directed Acyclic Graph Formation for IEEE 802.15.4 in Multihop Topologies

... reduce the number of ...to the PAN coordinator than ...removed and a disassociation proce- dure is engaged only when the association with a better parent is ...link: the association ... Voir le document complet

7

Oblivious and Semi-Oblivious Boundedness for Existential Rules

Oblivious and Semi-Oblivious Boundedness for Existential Rules

... have the following differences between boundedness for o-chase and ...termination and full-atomic-rewritability and ii) is equivalent to o-chase termination for ...DF(Σ), the ... Voir le document complet

8

Oblivious and Semi-Oblivious Boundedness for Existential Rules

Oblivious and Semi-Oblivious Boundedness for Existential Rules

... concerns the recursivity of rules, and asks whether there is an upper bound on the depth of the chase, which is independent from any database ...instance. The prop- erty is key for ... Voir le document complet

13

Optimal Gathering Protocols on Paths under Interference Constraints

Optimal Gathering Protocols on Paths under Interference Constraints

... study the problem of gathering information from the nodes of a multi-hop radio network into a predefined destination node under reachability and interference ...if the receiver ... Voir le document complet

24

Gathering algorithms on paths under interference constraints

Gathering algorithms on paths under interference constraints

... Pairs and obstructions in the rounds derived from Algorithm 2 for d = ...in the table but those between horizontal lines, the algorithm also includes its symmetric ...modifying the ... Voir le document complet

13

Spatial birth-death-move processes : basic properties and estimation of their intensity functions

Spatial birth-death-move processes : basic properties and estimation of their intensity functions

... where the birth and death dynamics depend on the spatial locations of ...individuals move during their life time according to a continuous Markov ...imaging and individual-based ... Voir le document complet

40

Basic creep of concrete under compression, tension and bending

Basic creep of concrete under compression, tension and bending

... cracks and/or water consumption by the hydration of anhydrous grains. The difficulty is then to estimate this shrinkage under ...In the case of the flexural creep test, this ... Voir le document complet

27

An Asynchronous Distributed Component Model and Its Semantics

An Asynchronous Distributed Component Model and Its Semantics

... Indeed, the abstractions suggested above imply that each memory location is only accessible by one component, and thus it is easy to place each component on a different independent ...component model ... Voir le document complet

22

Graph-based Clustering under Differential Privacy

Graph-based Clustering under Differential Privacy

... present the se- curity/accuracy trade-off of our new method in the differentially-private ...PAMST and the Weight-Release mechanism. Evaluating the ac- curacy of this method amounts to ... Voir le document complet

10

Continuous vs. Discrete Asynchronous Moves: a Certified Approach for Mobile Robots

Continuous vs. Discrete Asynchronous Moves: a Certified Approach for Mobile Robots

... spaces The core problem to solve in the context of mobile robot networks that evolve in bidimensional continuous spaces is pattern formation, where robots starting from distinct initial positions ... Voir le document complet

13

The Minimal Graph Model of Lambda Calculus

The Minimal Graph Model of Lambda Calculus

... Is there a continuous stable, strongly stable model whose theory is exactly or where is the minimal lambda theory and is the minimal extensional lambda theory?. Question 1 can be we[r] ... Voir le document complet

10

Graph-based Clustering under Differential Privacy

Graph-based Clustering under Differential Privacy

... 2013) and edge-differential privacy (Hay et al., 2009), both based on the graph topology, the privacy framework considered here is weight-differential privacy where the graph ... Voir le document complet

11

Corporate investment under uncertainty and the neoclassical model

Corporate investment under uncertainty and the neoclassical model

... In a world of uncertainty with a perfectly competitive capital market, the absolute amount of value-maximizing investment and output by the firm will be equal... The firm does not take e[r] ... Voir le document complet

52

Deducing Basic Graph Patterns from Logs of Linked Data Providers

Deducing Basic Graph Patterns from Logs of Linked Data Providers

... The documents may come from teaching and research institutions in France or abroad, or from public or private research centers.. L’archive ouverte pluridisciplinaire HAL, est destinée au[r] ... Voir le document complet

119

Show all 10000 documents...