5115 search results - page 327 / 1023 » On Randomized Lanczos Algorithms |
179
click to vote
WEA
2004
Springer
16 years 19 days ago
2004
Springer
Abstract. Graphs can be represented symbolically by the Ordered Binary Decision Diagram (OBDD) of their characteristic function. To solve problems in such implicitly given graphs, ...
196
click to vote
BIRTHDAY
2003
Springer
16 years 15 days ago
2003
Springer
Abstract. A novel framework for the design and analysis of energy-aware algorithms is presented, centered around a deterministic Bit-level (Boltzmann) Random Access Machine or BRAM...
188
click to vote
EMO
2001
Springer
15 years 11 months ago
2001
Springer
We compare two multiobjective evolutionary algorithms, with deterministic gradient based optimization methods for the dose optimization problem in high-dose rate (HDR) brachythera...
224
click to vote
EWCBR
2006
Springer
15 years 11 months ago
2006
Springer
Feature selection algorithms can reduce the high dimensionality of textual cases and increase case-based task performance. However, conventional algorithms (e.g., information gain)...
204
click to vote
GCC
2006
Springer
15 years 11 months ago
2006
Springer
In this paper, we propose a new scheduling algorithm with economic theory, called Black Scholes Market (BSM) algorithm for a class of Dynamic Jobs (DJ). BSM is based on the classi...