Sciweavers

1243 search results - page 220 / 249
» On the locality of bounded growth
Sort
View
BMCBI
2010
154views more  BMCBI 2010»
14 years 12 months ago
An algorithm for automated closure during assembly
Background: Finishing is the process of improving the quality and utility of draft genome sequences generated by shotgun sequencing and computational assembly. Finishing can invol...
Sergey Koren, Jason R. Miller, Brian Walenz, Grang...
CORR
2010
Springer
152views Education» more  CORR 2010»
14 years 12 months ago
Deploying Wireless Networks with Beeps
Abstract. We present the discrete beeping communication model, which assumes nodes have minimal knowledge about their environment and severely limited communication capabilities. S...
Alejandro Cornejo, Fabian Kuhn
IJRR
2008
92views more  IJRR 2008»
14 years 11 months ago
Robust and Efficient Covering of Unknown Continuous Domains with Simple, Ant-Like A(ge)nts
We propose a new `Mark-Ant-Walk' algorithm for robust and efficient covering of continuous domains by ant-like robots with very limited capabilities. The robots can mark plac...
Eliyahu Osherovich, Vladimir Yanovski, Israel A. W...
CORR
2007
Springer
106views Education» more  CORR 2007»
14 years 11 months ago
Bandit Algorithms for Tree Search
Bandit based methods for tree search have recently gained popularity when applied to huge trees, e.g. in the game of go [6]. Their efficient exploration of the tree enables to ret...
Pierre-Arnaud Coquelin, Rémi Munos
JMLR
2008
159views more  JMLR 2008»
14 years 11 months ago
Near-Optimal Sensor Placements in Gaussian Processes: Theory, Efficient Algorithms and Empirical Studies
When monitoring spatial phenomena, which can often be modeled as Gaussian processes (GPs), choosing sensor locations is a fundamental task. There are several common strategies to ...
Andreas Krause, Ajit Paul Singh, Carlos Guestrin