1568 search results - page 87 / 314 » The problem of examination questions in algorithmics |
143
click to vote
GECCO
2009
Springer
16 years 4 hour ago
2009
Springer
This work examines the dendritic cell algorithm (DCA) from a mathematical perspective. By representing the signal processing phase of the algorithm using the dot product it is sho...
167
click to vote
NIPS
2008
15 years 6 months ago
2008
Policy gradient (PG) reinforcement learning algorithms have strong (local) convergence guarantees, but their learning performance is typically limited by a large variance in the e...
127
click to vote
SIGACT
2010
15 years 3 months ago
2010
A fundamental question in complexity theory is whether every randomized polynomial time algorithm can be simulated by a deterministic polynomial time algorithm (that is, whether B...
147
click to vote
ICS
2010
Tsinghua U.
16 years 2 months ago
2010
Tsinghua U.
: We initiate the study of local, sublinear time algorithms for finding vertices with extreme topological properties -- such as high degree or clustering coefficient -- in large so...
135
click to vote
NETWORKING
2007
15 years 6 months ago
2007
Recently, Doubletree, a cooperative algorithm for large-scale topology discovery at the IP level, was introduced. Compared to classic probing systems, Doubletree discovers almost a...