5115 search results - page 699 / 1023 » On Randomized Lanczos Algorithms |
213
click to vote
TEC
2002
15 years 6 months ago
2002
In this paper, we describe a new incomplete approach for solving constraint satisfaction problems (CSPs) based on the ant colony optimization (ACO) metaheuristic. The idea is to us...
157
click to vote
TIT
2002
15 years 6 months ago
2002
Abstract--We adapt methods originally developed in information and coding theory to solve some testing problems. The efficiency of two-stage pool testing of items is characterized ...
186
click to vote
TPDS
2002
15 years 6 months ago
2002
In this paper, an efficient algorithm to implement loop partitioning is introduced and evaluated. We start from results of Agarwal et al. [1] whose aim is to minimize the number of...
178
click to vote
VLDB
2002
ACM
15 years 6 months ago
2002
ACM
Traditional indexes aim at optimizing the node accesses during query processing, which, however, does not necessarily minimize the total cost due to the possibly large number of r...
159
click to vote
AUTOMATICA
2010
15 years 6 months ago
2010
: The guarantee of feasibility given feasibility at initial time is an issue that has been overlooked by many of the recent papers on stochastic model predictive control. Effective...