Sciweavers

3758 search results - page 52 / 752
» A Complete Subsumption Algorithm
Sort
View
IROS
2008
IEEE
167views Robotics» more  IROS 2008»
14 years 2 months ago
Multi-robot complete exploration using hill climbing and topological recovery
— This article addresses the problem of autonomous map building and exploration of an unknown environment with mobile robots. The proposed method assumes that mobile robots use o...
Rui Rocha, João Filipe Ferreira, Jorge Dias
DATE
2002
IEEE
118views Hardware» more  DATE 2002»
14 years 18 days ago
A Complete Data Scheduler for Multi-Context Reconfigurable Architectures
: A new technique is presented in this paper to improve the efficiency of data scheduling for multi-context reconfigurable architectures targeting multimedia and DSP applications. ...
Marcos Sanchez-Elez, Milagros Fernández, Ra...
CONCUR
2008
Springer
13 years 9 months ago
Completeness and Nondeterminism in Model Checking Transactional Memories
Software transactional memory (STM) offers a disciplined concurrent programming model for exploiting the parallelism of modern processor architectures. This paper presents the firs...
Rachid Guerraoui, Thomas A. Henzinger, Vasu Singh
SEMWEB
2010
Springer
13 years 5 months ago
Optimising Ontology Classification
Abstract. Ontology classification--the computation of subsumption hierarchies for classes and properties--is one of the most important tasks for OWL reasoners. Based on the algorit...
Birte Glimm, Ian Horrocks, Boris Motik, Giorgos St...
NAR
2010
106views more  NAR 2010»
13 years 2 months ago
InParanoid 7: new algorithms and tools for eukaryotic orthology analysis
The InParanoid project gathers proteomes of completely sequenced eukaryotic species plus Escherichia coli and calculates pairwise ortholog relationships among them. The new releas...
Gabriel Östlund, Thomas Schmitt, Kristoffer F...