10051 search results - page 331 / 2011 » A Dynamic Separator Algorithm |
161
click to vote
SIGCSE
2000
ACM
15 years 11 months ago
2000
ACM
The paper elucidates two views (models) of algorithmic problem solving. The first one is static; it is based on the identification of several principal dimensions of algorithmic p...
190
click to vote
ICMLA
2008
15 years 8 months ago
2008
In evolving applications, there is a need for the dynamic selection of algorithms or algorithm parameters. Such selection is hardly ever governed by exact theory, so intelligent r...
353
click to vote
Book
"The objective of this edition is not only to assist the contestants during the contest hours but also describing the core subjects of Computer Science such as C Programming, ...
221
click to vote
WADS
2007
Springer
16 years 29 days ago
2007
Springer
A ball graph is an intersection graph of a set of balls with arbitrary radii. Given a real number t > 1, we say that a subgraph G′ of a graph G is a t-spanner of G, if for eve...
153
click to vote
CIMCA
2005
IEEE
16 years 14 days ago
2005
IEEE
An efficient training method for block-diagonal recurrent neural networks is proposed. The method modifies the RPROP algorithm, originally developed for static models, in order to...