1568 search results - page 169 / 314 » The problem of examination questions in algorithmics |
187
click to vote
SWAT
2004
Springer
15 years 11 months ago
2004
Springer
We study the following problem: Given a set V of n vertices and a set E of m edge pairs, we define a graph family G(V, E) as the set of graphs that have vertex set V and contain ...
162
click to vote
ICML
2006
IEEE
16 years 7 months ago
2006
IEEE
This paper examines high dimensional regression with noise-contaminated input and output data. Goals of such learning problems include optimal prediction with noiseless query poin...
171
click to vote
SDM
2009
SIAM
16 years 3 months ago
2009
SIAM
Given the pairwise affinity relations associated with a set of data items, the goal of a clustering algorithm is to automatically partition the data into a small number of homogen...
152
click to vote
GECCO
2007
Springer
16 years 16 days ago
2007
Springer
Estimation of distribution algorithms replace the typical crossover and mutation operators by constructing a probabilistic model and generating offspring according to this model....
156
click to vote
CIE
2009
Springer
16 years 29 days ago
2009
Springer
We suggest that a process-like notion of strategy is relevant in the context of interactions in systems of self-interested agents. In this view, strategies are not plans formulated...