Sciweavers

8917 search results - page 459 / 1784
» Abstraction in Algorithm Animation
Sort
View
WABI
2004
Springer
16 years 5 days ago
The Minisatellite Transformation Problem Revisited: A Run Length Encoded Approach
Abstract. In this paper we present a more efficient algorithm for comparison of minisatellites which has complexity O(n 3 + m 3 + mn 2 + nm 2 + mn) where n and m are the lengths of...
Behshad Behzadi, Jean-Marc Steyaert
ICALP
2003
Springer
16 years 1 days ago
Generating Labeled Planar Graphs Uniformly at Random
Abstract. We present an expected polynomial time algorithm to generate a labeled planar graph uniformly at random. To generate the planar graphs, we derive recurrence formulas that...
Manuel Bodirsky, Clemens Gröpl, Mihyun Kang
ICRA
2002
IEEE
113views Robotics» more  ICRA 2002»
15 years 11 months ago
Huey, Dewey, Louie, and GUI - Commanding Robot Formations
We present a graphical user interface (GUI) for easy, intuitive control of a group of mobile robots moving in formation, and we give a short description of the general, local, dis...
Jakob Fredslund, Maja J. Mataric
RR
2009
Springer
15 years 11 months ago
Search for More Declarativity
Abstract. Good tree search algorithms are a key requirement for inference engines of rule languages. As Prolog exemplifies, inference engines based on traditional uninformed searc...
Simon Brodt, François Bry, Norbert Eisinger
IPPS
2000
IEEE
15 years 11 months ago
On Identifying Strongly Connected Components in Parallel
Abstract. The standard serial algorithm for strongly connected components is based on depth rst search, which is di cult to parallelize. We describe a divide-and-conquer algorithm ...
Lisa Fleischer, Bruce Hendrickson, Ali Pinar