Sciweavers

160 search results - page 32 / 32
» Definition and Complexity of Some Basic Metareasoning Proble...
Sort
View
146
Voted
WWW
2006
ACM
16 years 4 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...
131
Voted
SIROCCO
2008
15 years 5 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...
120
Voted
SODA
2010
ACM
209views Algorithms» more  SODA 2010»
16 years 27 days 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
127
Voted
IROS
2007
IEEE
198views Robotics» more  IROS 2007»
15 years 9 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
15 years 9 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