Sciweavers

6368 search results - page 1086 / 1274
» Modeling Problem Transformations based on Data Complexity
Sort
View
CORR
2006
Springer
153views Education» more  CORR 2006»
15 years 6 months ago
Genetic Programming, Validation Sets, and Parsimony Pressure
Fitness functions based on test cases are very common in Genetic Programming (GP). This process can be assimilated to a learning task, with the inference of models from a limited n...
Christian Gagné, Marc Schoenauer, Marc Pari...
NAR
2011
214views Computer Vision» more  NAR 2011»
14 years 9 months ago
DAnCER: Disease-Annotated Chromatin Epigenetics Resource
Chromatin modification (CM) is a set of epigenetic processes that govern many aspects of DNA replication, transcription and repair. CM is carried out by groups of physically inter...
Andrei L. Turinsky, Brian Turner, Rosanne C. Borja...
182
Voted
IJCAI
2003
15 years 7 months ago
Spaces of Theories with Ideal Refinement Operators
Refinement operators for theories avoid the problems related to the myopia of many relational learning algorithms based on the operators that refine single clauses. However, the n...
Nicola Fanizzi, Stefano Ferilli, Nicola Di Mauro, ...
QEST
2007
IEEE
16 years 20 days ago
GRIP: Generic Representatives in PRISM
We give an overview of GRIP, a symmetry reduction tool for the probabilistic model checker PRISM, together with experimental results for a selection of example specifications. 1 ...
Alastair F. Donaldson, Alice Miller, David Parker
184
Voted
HPCA
2006
IEEE
16 years 6 months ago
Completely verifying memory consistency of test program executions
An important means of validating the design of commercial-grade shared memory multiprocessors is to run a large number of pseudo-random test programs on them. However, when intent...
Chaiyasit Manovit, Sudheendra Hangal
« Prev « First page 1086 / 1274 Last » Next »