Sciweavers

147 search results - page 2 / 30
» Describing Problem Solving Methods using Anytime Performance...
Sort
View
UAI
2008
13 years 7 months ago
Strategy Selection in Influence Diagrams using Imprecise Probabilities
This paper describes a new algorithm to solve the decision making problem in Influence Diagrams based on algorithms for credal networks. Decision nodes are associated to imprecise...
Cassio Polpo de Campos, Qiang Ji
IPPS
2002
IEEE
13 years 10 months ago
A High Performance Algorithm for Incompressible Flows Using Local Solenoidal Functions
The convergence of iterative methods used to solve the linear systems arising in incompressible flow problems is sensitive to flow parameters such as the Reynolds number, time s...
Sreekanth R. Sambavaram, Vivek Sarin
BMCBI
2008
178views more  BMCBI 2008»
13 years 5 months ago
A discriminative method for protein remote homology detection and fold recognition combining Top-n-grams and latent semantic ana
Background: Protein remote homology detection and fold recognition are central problems in bioinformatics. Currently, discriminative methods based on support vector machine (SVM) ...
Bin Liu, Xiaolong Wang, Lei Lin, Qiwen Dong, Xuan ...
ICASSP
2009
IEEE
14 years 15 days ago
Using phase linearity in frequency-domain ICA to tackle the permutation problem
This paper describes a method for solving the permutation problem in the frequency-domain independent component analysis (FD-ICA) approach to blind source separation (BSS). FD-ICA...
Keisuke Toyama, Mark D. Plumbley
AIPS
2010
13 years 8 months ago
Action Elimination and Plan Neighborhood Graph Search: Two Algorithms for Plan Improvement
Compared to optimal planners, satisficing planners can solve much harder problems but may produce overly costly and long plans. Plan quality for satisficing planners has become in...
Hootan Nakhost, Martin Müller 0003