Sciweavers

10718 search results - page 397 / 2144
» On the Circuit Implementation Problem
Sort
View
APPROX
2006
Springer
126views Algorithms» more  APPROX 2006»
15 years 10 months ago
Better Approximations for the Minimum Common Integer Partition Problem
Abstract. In the k-Minimum Common Integer Partition Problem, abbreviated k-MCIP, we are given k multisets X1, . . . , Xk of positive integers, and the goal is to find an integer mu...
David P. Woodruff
MSV
2004
15 years 8 months ago
An Effective QBF Solver for Planning Problems
A large number of applications can be represented by quantified Boolean formulas (QBF). Although evaluating QBF is NP-hard and thus very difficult, there has been significant progr...
Charles Otwell, Anja Remshagen, Klaus Truemper
UAI
2003
15 years 8 months ago
The Revisiting Problem in Mobile Robot Map Building: A Hierarchical Bayesian Approach
We present an application of hierarchical Bayesian estimation to robot map building. The revisiting problem occurs when a robot has to decide whether it is seeing a previously-bui...
Benjamin Stewart, Jonathan Ko, Dieter Fox, Kurt Ko...
AES
2007
Springer
92views Cryptology» more  AES 2007»
15 years 7 months ago
MicroARTMAP for pattern recognition problems
Pattern recognition is an important aspect of a dominant technology such as machine intelligence. Domain specific fuzzy-neuro models particularly for the ‘black box’ implemen...
Sundaramoorthy Rajasekaran, Vasantha Kalyani David
179
Voted
COR
2006
122views more  COR 2006»
15 years 6 months ago
Experimental Analysis of Approximation Algorithms for the Vertex Cover and Set Covering Problems
Several approximation algorithms with proven performance guarantees have been proposed to find approximate solutions to classical combinatorial optimization problems. However, the...
Fernando C. Gomes, Cláudio Nogueira de Mene...