Sciweavers

160 search results - page 32 / 32
» Definition and Complexity of Some Basic Metareasoning Proble...
Sort
View
WWW
2006
ACM
14 years 6 months ago
Compressing and searching XML data via two zips
XML is fast becoming the standard format to store, exchange and publish over the web, and is getting embedded in applications. Two challenges in handling XML are its size (the XML...
Paolo Ferragina, Fabrizio Luccio, Giovanni Manzini...
SIROCCO
2008
13 years 6 months ago
Remembering without Memory: Tree Exploration by Asynchronous Oblivious Robots
In the effort to understand the algorithmic limitations of computing by a swarm of robots, the research has focused on the minimal capabilities that allow a problem to be solved. ...
Paola Flocchini, David Ilcinkas, Andrzej Pelc, Nic...
SODA
2010
ACM
209views Algorithms» more  SODA 2010»
14 years 2 months ago
Counting Stars and Other Small Subgraphs in Sublinear Time
Detecting and counting the number of copies of certain subgraphs (also known as network motifs or graphlets), is motivated by applications in a variety of areas ranging from Biolo...
Mira Gonen, Dana Ron, Yuval Shavitt
IROS
2007
IEEE
198views Robotics» more  IROS 2007»
13 years 11 months ago
Cooperation of heterogeneous, autonomous robots: A case study of humanoid and wheeled robots
Abstract— In this paper we present a case study of cooperation of a strongly heterogeneous robot team, composed of a highly articulated humanoid robot and a wheeled robot with la...
Jutta Kiener, Oskar von Stryk
TPHOL
2005
IEEE
13 years 11 months ago
A HOL Theory of Euclidean Space
We describe a formalization of the elementary algebra, topology and analysis of finite-dimensional Euclidean space in the HOL Light theorem prover. (Euclidean space is RN with the...
John Harrison