Sciweavers

4698 search results - page 195 / 940
» Making Functionality More General
Sort
View
ENTCS
2007
153views more  ENTCS 2007»
15 years 3 months ago
The Methods of Approximation and Lifting in Real Computation
The basic motivation behind this work is to tie together various computational complexity classes, whether over different domains such as the naturals or the reals, or whether de...
Manuel Lameiras Campagnolo, Kerry Ojakian
CEC
2007
IEEE
15 years 10 months ago
Greedy transformation of evolutionary algorithm search spaces for scheduling problems
— Many scheduling algorithms search the space of possible solutions (schedules), but some instead search the space of permutations of the set of jobs, employing a greedy algorith...
David Joslin, Justin Collins
SAFECOMP
2007
Springer
15 years 10 months ago
Software Encoded Processing: Building Dependable Systems with Commodity Hardware
In future, the decreasing feature size and the reduced power supply will make it much more difficult to built reliable microprocessors. Economic pressure will most likely result in...
Ute Wappler, Christof Fetzer
WSC
2007
15 years 6 months ago
Transformations for accelerating MCMC simulations with broken ergodicity
A new approach for overcoming broken ergodicity in Markov Chain Monte Carlo (MCMC) simulations of complex systems is described. The problem of broken ergodicity is often present i...
Mark Fleischer
111
Voted
MCS
2007
Springer
15 years 3 months ago
Exploiting Diversity in Ensembles: Improving the Performance on Unbalanced Datasets
Abstract. Ensembles are often capable of greater predictive performance than any of their individual classifiers. Despite the need for classifiers to make different kinds of err...
Nitesh V. Chawla, Jared Sylvester