Sciweavers

377 search results - page 16 / 76
» A Fast Heuristic Algorithm for a Probe Mapping Problem
Sort
View
AIPS
2006
13 years 10 months ago
Fast Probabilistic Planning through Weighted Model Counting
We present a new algorithm for probabilistic planning with no observability. Our algorithm, called Probabilistic-FF, extends the heuristic forward-search machinery of Conformant-F...
Carmel Domshlak, Jörg Hoffmann
AROBOTS
2002
91views more  AROBOTS 2002»
13 years 8 months ago
Fast, On-Line Learning of Globally Consistent Maps
To navigate in unknown environments, mobile robots require the ability to build their own maps. A major problem for robot map building is that odometry-based dead reckoning cannot ...
Tom Duckett, Stephen Marsland, Jonathan Shapiro
ASPDAC
2010
ACM
163views Hardware» more  ASPDAC 2010»
13 years 6 months ago
A3MAP: architecture-aware analytic mapping for networks-on-chip
- In this paper, we propose a novel and global A3MAP (Architecture-Aware Analytic Mapping) algorithm applied to NoC (Networks-on-Chip) based MPSoC (Multi-Processor System-on-Chip) ...
Wooyoung Jang, David Z. Pan
SADM
2008
178views more  SADM 2008»
13 years 8 months ago
Fast Projection-Based Methods for the Least Squares Nonnegative Matrix Approximation Problem
: Nonnegative matrix approximation (NNMA) is a popular matrix decomposition technique that has proven to be useful across a diverse variety of fields with applications ranging from...
Dongmin Kim, Suvrit Sra, Inderjit S. Dhillon
WEA
2005
Springer
93views Algorithms» more  WEA 2005»
14 years 2 months ago
From Static Code Distribution to More Shrinkage for the Multiterminal Cut
We present the problem of statically distributing instructions of a common programming language, a problem which we prove equivalent to the multiterminal cut problem. We design eï¬...
Bram De Wachter, Alexandre Genon, Thierry Massart