Sciweavers

1957 search results - page 172 / 392
» Approximate algorithms for neural-Bayesian approaches
Sort
View
IJCAI
2007
14 years 11 months ago
Scalable Diagnosability Checking of Event-Driven Systems
Diagnosability of systems is an essential property that determines how accurate any diagnostic reasoning can be on a system given any sequence of observations. Generally, in the l...
Anika Schumann, Yannick Pencolé
IANDC
2006
86views more  IANDC 2006»
14 years 10 months ago
Table design in dynamic programming
Dynamic Programming solves combinatorial optimization problems by recursive decomposition and tabulation of intermediate results. The first step in the design of a dynamic program...
Peter Steffen, Robert Giegerich
INFORMATICALT
2010
103views more  INFORMATICALT 2010»
14 years 4 months ago
Multistage K-Means Clustering for Scenario Tree Construction
Abstract. In stochastic programming and decision analysis, an important issue consists in the approximate representation of the multidimensional stochastic underlying process in th...
Kristina Sutiene, Dalius Makackas, Henrikas Pranev...
92
Voted
VLSID
2006
IEEE
240views VLSI» more  VLSID 2006»
15 years 10 months ago
An Efficient and Accurate Logarithmic Multiplier Based on Operand Decomposition
Logarithmic Number Systems (LNS) offer a viable alternative in terms of area, delay and power to binary number systems for multiplication and division operations in signal process...
Venkataraman Mahalingam, N. Ranganathan
MICAI
2005
Springer
15 years 3 months ago
Proximity Searching in High Dimensional Spaces with a Proximity Preserving Order
Abstract. Kernel based methods (such as k-nearest neighbors classifiers) for AI tasks translate the classification problem into a proximity search problem, in a space that is usu...
Edgar Chávez, Karina Figueroa, Gonzalo Nava...