5115 search results - page 343 / 1023 » On Randomized Lanczos Algorithms |
232
click to vote
AUSAI
2003
Springer
16 years 19 days ago
2003
Springer
Abstract. The RGCP (Robust Graph Coloring problem) is a new variant of the traditional graph coloring problem. It has numerous practical applications in real world like timetabling...
190
click to vote
SBRN
2000
IEEE
15 years 11 months ago
2000
IEEE
d Articles >> Table of Contents >> Abstract VI Brazilian Symposium on Neural Networks (SBRN'00) p. 24 Adaptation of Parameters of BP Algorithm Using Automata Hamid...
169
click to vote
CSL
2006
Springer
15 years 11 months ago
2006
Springer
We study observation-based strategies for two-player turn-based games on graphs with omega-regular objectives. An observation-based strategy relies on imperfect information about t...
254
click to vote
DAMON
2008
Springer
15 years 9 months ago
2008
Springer
NAND flash memory is fast becoming popular as a component of large scale storage devices. For workloads requiring many random I/Os, flash devices can provide two orders of magnitu...
175
click to vote
NETWORKING
2007
15 years 8 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...