Sciweavers

66 search results - page 6 / 14
» Enhancing Automated Test Selection in Probabilistic Networks
Sort
View
BMCBI
2008
208views more  BMCBI 2008»
13 years 11 months ago
GraphFind: enhancing graph searching by low support data mining techniques
Background: Biomedical and chemical databases are large and rapidly growing in size. Graphs naturally model such kinds of data. To fully exploit the wealth of information in these...
Alfredo Ferro, Rosalba Giugno, Misael Mongiov&igra...
POPL
2007
ACM
14 years 11 months ago
Program verification as probabilistic inference
In this paper, we propose a new algorithm for proving the validity or invalidity of a pre/postcondition pair for a program. The algorithm is motivated by the success of the algori...
Sumit Gulwani, Nebojsa Jojic
ICPPW
2006
IEEE
14 years 5 months ago
Dynamic Algorithm Selection in Parallel GAMESS Calculations
Applications augmented with adaptive capabilities are becoming common in parallel computing environments which share resources such as main memory, network, or disk I/O. For large...
Nurzhan Ustemirov, Masha Sosonkina, Mark S. Gordon...
ICCS
2005
Springer
14 years 4 months ago
Model-Based Statistical Testing of a Cluster Utility
Abstract. As High Performance Computing becomes more collaborative, software certification practices are needed to quantify the credibility of shared applications. To demonstrate q...
W. Thomas Swain, Stephen L. Scott
GECCO
2006
Springer
201views Optimization» more  GECCO 2006»
14 years 2 months ago
Selective self-adaptive approach to ant system for solving unit commitment problem
This paper presents a novel approach to solve the constrained unit commitment problem using Selective Self-Adaptive Ant System (SSAS) for improving search performance by automatic...
Songsak Chusanapiputt, Dulyatat Nualhong, Sujate J...