77 search results - page 15 / 16 » Sample Size Lower Bounds in PAC Learning by Algorithmic Comp... |
SIAMCOMP
1998
13 years 7 months ago
1998
Motivated by applications in computer graphics, visualization, and scienti c computation, we study the computational complexity of the following problem: Given a set S of n points...
GPEM
2008
13 years 7 months ago
2008
Efficiency enhancement techniques--such as parallelization and hybridization--are among the most important ingredients of practical applications of genetic and evolutionary algori...
PODC
2004
ACM
14 years 27 days ago
2004
ACM
We introduce the distributed gradient clock synchronization problem. As in traditional distributed clock synchronization, we consider a network of nodes equipped with hardware clo...
CORR
2011
Springer
13 years 2 months ago
2011
Springer
Valiant’s (2007) model of evolvability models the evolutionary process of acquiring useful functionality as a restricted form of learning from random examples. Linear threshold ...
ATAL
2008
Springer
13 years 9 months ago
2008
Springer
Many multiagent domains where cooperation among agents is crucial to achieving a common goal can be modeled as coalitional games. However, in many of these domains, agents are une...