Sciweavers

1957 search results - page 101 / 392
» Approximate algorithms for neural-Bayesian approaches
Sort
View
RSS
2007
134views Robotics» more  RSS 2007»
14 years 11 months ago
A Fast and Practical Algorithm for Generalized Penetration Depth Computation
— We present an efficient algorithm to compute the generalized penetration depth (PDg) between rigid models. Given two overlapping objects, our algorithm attempts to compute the...
Liangjun Zhang, Young J. Kim, Dinesh Manocha
ICASSP
2009
IEEE
15 years 4 months ago
A simple, efficient and near optimal algorithm for compressed sensing
When sampling signals below the Nyquist rate, efficient and accurate reconstruction is nevertheless possible, whenever the sampling system is well behaved and the signal is well ...
Thomas Blumensath, Mike E. Davies
ACST
2006
14 years 11 months ago
Experimental study of hybrid-type distributed maximal constraint satisfaction algorithm
A constraint satisfaction problem (CSP) is a general framework that can formalize various application problems in artificial intelligence. However, practical real-world problems t...
Masato Noto, Masahito Kurihara
EAAI
2007
103views more  EAAI 2007»
14 years 9 months ago
Particle swarm-based optimal partitioning algorithm for combinational CMOS circuits
This paper presents a swarm intelligence based approach to optimally partition combinational CMOS circuits for pseudoexhaustive testing. The partitioning algorithm ensures reducti...
Ganesh K. Venayagamoorthy, Scott C. Smith, Gaurav ...
ECAL
2007
Springer
15 years 4 months ago
A Distributed Formation Algorithm to Organize Agents with No Coordinate Agreement
Abstract. In this paper we present an extension of the ShapeBugs distributed formation algorithm which enables 2D mobile agents to agree on a consensus coordinate system starting f...
Gregory Studer, Inman Harvey