Sciweavers

80 search results - page 3 / 16
» Finding Cores of Limited Length
Sort
View
RAS
2002
129views more  RAS 2002»
13 years 5 months ago
Finding and optimizing solvable priority schemes for decoupled path planning techniques for teams of mobile robots
Coordinating the motion of multiple mobile robots is one of the fundamental problems in robotics. The predominant algorithms for coordinating teams of robots are decoupled and pri...
Maren Bennewitz, Wolfram Burgard, Sebastian Thrun
TAMC
2007
Springer
13 years 12 months ago
Finding a Duplicate and a Missing Item in a Stream
We consider the following problem in a stream model: Given a sequence a = a1, a2, . . . , am wich each ai ∈ [n] = {1, . . . , n} and m > n, find a duplicate in the sequence, ...
Jun Tarui
COMBINATORICS
2002
113views more  COMBINATORICS 2002»
13 years 5 months ago
Longest Increasing Subsequences in Pattern-Restricted Permutations
Inspired by the results of Baik, Deift and Johansson on the limiting distribution of the lengths of the longest increasing subsequences in random permutations, we find those limit...
Emeric Deutsch, A. J. Hildebrand, Herbert S. Wilf
SGAI
2010
Springer
13 years 3 months ago
Extending SATPLAN to Multiple Agents
Multi-agent planning is a core issue in the multi-agent systems field. In this work we focus on the coordination of multiple agents in a setting where agents are able to achieve in...
Yannis Dimopoulos, Muhammad Adnan Hashmi, Pavlos M...
CIBCB
2005
IEEE
13 years 11 months ago
Network Motifs, Feedback Loops and the Dynamics of Genetic Regulatory Networks
We analyse a suite of Boolean networks which have been evolved to exhibit limit cycle-type dynamics in terms of the distribution of small network motifs and feedback loops. We find...
Jennifer Hallinan, Paul T. Jackway