نتایج جستجو برای: pure rendezvous

تعداد نتایج: 96321  

1988
J. W. Miernik

Multi-tasking multiprocessor systems frequently use rendezvous for intertask communication , and Stochastic Rendezvous Networks are a form of performance model for such systems. Tasks are frequently given diierent priorities to adjust the system performance. This paper considers a pre-emptive-resume priority discipline for executing tasks sharing each processor. An iterative algorithm is propos...

Journal: :Theoretical Computer Science 2006

Journal: :IEEE Transactions on Computer-Aided Design of Integrated Circuits and Systems 2010

Journal: :Int. J. Found. Comput. Sci. 2011
Fabienne Carrier Stéphane Devismes Franck Petit Yvan Rivierre

In this paper, we address the deterministic rendezvous in graphs where k mobile agents, disseminated at different times and different nodes, have to meet in finite time at the same node. The mobile agents are autonomous, oblivious, labeled, and move asynchronously. Moreover, we consider an undirected anonymous connected graph. For this problem, we exhibit some asymptotical time and space lower ...

2014
Malika Meghjani Gregory Dudek

We present an algorithm for finding a distance optimal rendezvous location with respect to both initial and target locations of two mobile agents. These agents can be humans or robots, who need to meet and split while performing a collaborative task. Our aim is to embed the meeting process within a background activity such that the agents travel through the same rendezvous location while taking...

2013
Neil Smyth John S. Davis Thomas Huining Feng Mudit Goel Edward A. Lee Thomas M. Parks Yang Zhao

This is a chapter from the book System Design, Modeling, and Simulation using Ptolemy II This work is licensed under the Creative Commons Attribution-ShareAlike 3.0 Unported License. To view a copy of this license, visit: http://creativecommons.org/licenses/by-sa/3.0/, or send a letter to Creative Commons, 444 Castro Street, Suite 900, Mountain View, California, 94041, USA. Permissions beyond t...

Journal: :SIAM J. Control and Optimization 2006
Steve Alpern V. J. Baston

Two players are placed on the integer lattice Z (consisting of points in n dimensional space with all coordinates integers) so that their vector difference is of length 2 and parallel to one of the axes. Their aim is to move to an adjacent node in each period, so that they meet (occupy same node) in least expected time R (n) , called the Rendezvous Value. We assume they have no common notion of...

2003
Terry Huntsberger Yang Cheng Eric T. Baumgartner Matthew Robinson Paul S. Schenker

The upcoming missions to Mars planned by NASA/JPL in 2009 and 2013 are more ambitious than any previously flown. Included in these missions are extended multi-kilometer traverses, and autonomous rover rendezvous with science targets and man-made structures such as landers. This paper reports some of the ongoing work at JPL in the areas of autonomous sensory fusion of both raw and derived inputs...

نمودار تعداد نتایج جستجو در هر سال

با کلیک روی نمودار نتایج را به سال انتشار فیلتر کنید