Sciweavers

9626 search results - page 1528 / 1926
» Invariant Based Programming
Sort
View
ESANN
2004
15 years 8 months ago
Sparse LS-SVMs using additive regularization with a penalized validation criterion
This paper is based on a new way for determining the regularization trade-off in least squares support vector machines (LS-SVMs) via a mechanism of additive regularization which ha...
Kristiaan Pelckmans, Johan A. K. Suykens, Bart De ...
IJCAI
1997
15 years 8 months ago
Mini-Buckets: A General Scheme for Generating Approximations in Automated Reasoning
The class of algorithms for approximating reasoning tasks presented in this paper is based on approximating the general bucket elimination framework. The algorithms have adjustabl...
Rina Dechter
CCGRID
2010
IEEE
15 years 8 months ago
A High-Level Interpreted MPI Library for Parallel Computing in Volunteer Environments
Idle desktops have been successfully used to run sequential and master-slave task parallel codes on a large scale in the context of volunteer computing. However, execution of messa...
Troy P. LeBlanc, Jaspal Subhlok, Edgar Gabriel
GECCO
2010
Springer
186views Optimization» more  GECCO 2010»
15 years 8 months ago
Genetic rule extraction optimizing brier score
Most highly accurate predictive modeling techniques produce opaque models. When comprehensible models are required, rule extraction is sometimes used to generate a transparent mod...
Ulf Johansson, Rikard König, Lars Niklasson
BMCBI
2010
172views more  BMCBI 2010»
15 years 7 months ago
Accessing the SEED genome databases via Web services API: tools for programmers
Background: The SEED integrates many publicly available genome sequences into a single resource. The database contains accurate and up-to-date annotations based on the subsystems ...
Terry Disz, Sajia Akhter, Daniel Cuevas, Robert Ol...
« Prev « First page 1528 / 1926 Last » Next »