Sciweavers

170 search results - page 12 / 34
» Relevance Cuts: Localizing the Search
Sort
View
EVOW
2004
Springer
14 years 1 months ago
Scatter Search and Memetic Approaches to the Error Correcting Code Problem
We consider the problem of designing error correcting codes (ECC), a hard combinatorial optimization problem of relevance in the field of telecommunications. This problem is tackl...
Carlos Cotta
CI
2007
124views more  CI 2007»
13 years 7 months ago
Searching for Explanatory Web Pages Using Automatic Query Expansion
: When one tries to use the Web as a dictionary or encyclopedia, entering some single term into a search engine, the highly-ranked pages in the result can include irrelevant or use...
Manabu Tauchi, Nigel Ward
ICCAD
2004
IEEE
158views Hardware» more  ICCAD 2004»
14 years 4 months ago
DAOmap: a depth-optimal area optimization mapping algorithm for FPGA designs
In this paper we study the technology mapping problem for FPGA architectures to minimize chip area, or the total number of lookup tables (LUTs) of the mapped design, under the chi...
Deming Chen, Jason Cong
IROS
2007
IEEE
142views Robotics» more  IROS 2007»
14 years 1 months ago
Decentralized SLAM for pedestrians without direct communication
Abstract— We consider the problem of Decentralized Simultaneous Localization And Mapping (DSLAM) for pedestrians in the context of Urban Search And Rescue (USAR). In this context...
Alexander Kleiner, Dali Sun
CORR
2007
Springer
106views Education» more  CORR 2007»
13 years 7 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