Sciweavers

915 search results - page 27 / 183
» Maximally Abstract Retrenchments
Sort
View
ICRA
2010
IEEE
182views Robotics» more  ICRA 2010»
13 years 6 months ago
Informative path planning for an autonomous underwater vehicle
Abstract— We present a path planning method for autonomous underwater vehicles in order to maximize mutual information. We adapt a method previously used for surface vehicles, an...
Jonathan Binney, Andreas Krause, Gaurav S. Sukhatm...
JGO
2010
89views more  JGO 2010»
13 years 6 months ago
Iterative regularization algorithms for constrained image deblurring on graphics processors
Abstract The ability of the modern graphics processors to operate on large matrices in parallel can be exploited for solving constrained image deblurring problems in a short time. ...
Valeria Ruggiero, Thomas Serafini, Riccardo Zanell...
JUCS
2010
83views more  JUCS 2010»
13 years 6 months ago
Detecting Market Trends by Ignoring It, Some Days
Abstract: The last k days of trading together tell the financial market trends. It may be inconceivable if we are told to ignore the 3rd, 6th, and 8th day, a priori. We introduce ...
Jessie Wenhui Zou, Xiaotie Deng, Ming Li
PERCOM
2010
ACM
13 years 6 months ago
BACCARAT: a dynamic real-time bandwidth allocation policy for IEEE 802.15.4
Abstract—Recently, researchers and engineers began considering the use of WSN in time-sensitive applications. For effective real-time communications, it is important to solve the...
Christian Nastasi, Mauro Marinoni, Luca Santinelli...
PPSN
2010
Springer
13 years 6 months ago
Fixed Parameter Evolutionary Algorithms and Maximum Leaf Spanning Trees: A Matter of Mutation
Abstract. Evolutionary algorithms have been shown to be very successful for a wide range of NP-hard combinatorial optimization problems. We investigate the NP-hard problem of compu...
Stefan Kratsch, Per Kristian Lehre, Frank Neumann,...