Sciweavers

2030 search results - page 61 / 406
» Extremal Problems of Information Combining
Sort
View
CRV
2005
IEEE
225views Robotics» more  CRV 2005»
14 years 2 months ago
Distributed Multi-Robot Exploration and Mapping
— Efficient exploration of unknown environments is a fundamental problem in mobile robotics. In this paper we present an approach to distributed multi-robot mapping and explorat...
Dieter Fox
DIS
2004
Springer
14 years 2 months ago
Predictive Graph Mining
Abstract. Graph mining approaches are extremely popular and effective in molecular databases. The vast majority of these approaches first derive interesting, i.e. frequent, patte...
Andreas Karwath, Luc De Raedt
ASPDAC
2007
ACM
98views Hardware» more  ASPDAC 2007»
14 years 1 months ago
Fast Analytic Placement using Minimum Cost Flow
Many current integrated circuits designs, such as those released for the ISPD2005[14] placement contest, are extremely large and can contain a great deal of white space. These new...
Ameya R. Agnihotri, Patrick H. Madden
ACL
2001
13 years 10 months ago
Fast Decoding and Optimal Decoding for Machine Translation
A good decoding algorithm is critical to the success of any statistical machine translation system. The decoder's job is to find the translation that is most likely according...
Ulrich Germann, Michael Jahr, Kevin Knight, Daniel...
ECAI
2010
Springer
13 years 10 months ago
Nested Monte-Carlo Expression Discovery
Nested Monte-Carlo search is a general algorithm that gives good results in single player games. Genetic Programming evaluates and combines trees to discover expressions that maxim...
Tristan Cazenave