3250 search results - page 502 / 650 » Parameterized Learning Complexity |
119
Voted
CEC
2005
IEEE
15 years 5 months ago
2005
IEEE
Abstract- Decomposing a complex computational problem into sub-problems, which are computationally simpler to solve individually and which can be combined to produce a solution to ...
138
Voted
IADIS
2008
15 years 5 months ago
2008
Programming and developing of small scale software applications can be accomplished with simple command-line compilers that can be used to compile, test, and execute code generati...
121
Voted
NIPS
2007
15 years 5 months ago
2007
The expectation maximization (EM) algorithm is a widely used maximum likelihood estimation procedure for statistical models when the values of some of the variables in the model a...
130
click to vote
NIPS
2007
15 years 5 months ago
2007
Clustering is often formulated as a discrete optimization problem. The objective is to find, among all partitions of the data set, the best one according to some quality measure....
127
Voted
UAI
2000
15 years 5 months ago
2000
We propose a new approach to the problem of searching a space of policies for a Markov decision process (MDP) or a partially observable Markov decision process (POMDP), given a mo...