2905 search results - page 431 / 581 » Formal Memetic Algorithms |
131
Voted
DAC
2005
ACM
16 years 4 months ago
2005
ACM
SAT (Boolean satisfiability) has become the primary Boolean reasoning engine for many EDA applications, so the efficiency of SAT solving is of great practical importance. Recently...
125
click to vote
ICML
2008
IEEE
16 years 4 months ago
2008
IEEE
We propose Laplace max-margin Markov networks (LapM3 N), and a general class of Bayesian M3 N (BM3 N) of which the LapM3 N is a special case with sparse structural bias, for robus...
111
Voted
ICML
2006
IEEE
16 years 4 months ago
2006
IEEE
When constructing a classifier from labeled data, it is important not to assign too much weight to any single input feature, in order to increase the robustness of the classifier....
129
click to vote
ICML
2005
IEEE
16 years 4 months ago
2005
IEEE
This paper presents a novel framework called proto-reinforcement learning (PRL), based on a mathematical model of a proto-value function: these are task-independent basis function...
129
click to vote
ICML
2004
IEEE
16 years 4 months ago
2004
IEEE
This paper addresses the problem of finding a small and coherent subset of points in a given data. This problem, sometimes referred to as one-class or set covering, requires to fi...