Sciweavers

5615 search results - page 111 / 1123
» On the Computational Capabilities of Several Models
Sort
View
RAS
2002
247views more  RAS 2002»
14 years 9 months ago
Reference scan matching for global self-localization
Especially in dynamic environments a key feature concerning the robustness of mobile robot navigation is the capability of global self-localization. This term denotes a robot'...
Joachim Weber, Lutz Franken, Klaus-Werner Jör...
MP
2010
145views more  MP 2010»
14 years 8 months ago
The traveling salesman problem with pickup and delivery: polyhedral results and a branch-and-cut algorithm
The Traveling Salesman Problem with Pickup and Delivery (TSPPD) is defined on a graph containing pickup and delivery vertices between which there exists a one-toone relationship. ...
Irina Dumitrescu, Stefan Ropke, Jean-Franço...
PODC
2004
ACM
15 years 3 months ago
Computation in networks of passively mobile finite-state sensors
We explore the computational power of networks of small resource-limited mobile agents. We define two new models of computation based on pairwise interactions of finite-state ag...
Dana Angluin, James Aspnes, Zoë Diamadi, Mich...
CORR
2004
Springer
180views Education» more  CORR 2004»
14 years 9 months ago
Self-Organized Stigmergic Document Maps: Environment as a Mechanism for Context Learning
Social insect societies and more specifically ant colonies, are distributed systems that, in spite of the simplicity of their individuals, present a highly structured social organi...
Vitorino Ramos, Juan J. Merelo Guervós
BMCBI
2011
14 years 4 months ago
Multithreaded comparative RNA secondary structure prediction using stochastic context-free grammars
Background: The prediction of the structure of large RNAs remains a particular challenge in bioinformatics, due to the computational complexity and low levels of accuracy of state...
Zsuzsanna Sukosd, Bjarne Knudsen, Morten Vaerum, J...