225 search results - page 38 / 45 » A Least-Certainty Heuristic for Selective Search |
PETRA
2009
ACM
14 years 3 months ago
2009
ACM
Given a 3D environment, a set of constraints, and a set of sensor models, this paper addresses the problem of finding the set of sensors and their corresponding placement that cov...
GECCO
2007
Springer
14 years 3 months ago
2007
Springer
The Cross Entropy algorithm is a new search method for combinatorial problem. However, it needs considerable computational time to achieve good solution quality. To make the Cross...
ICDE
2000
IEEE
14 years 1 months ago
2000
IEEE
We consider an architecture of mediators and wrappers for Internet accessible WebSources of limited query capability. Each call to a source is a WebSource Implementation (WSI) and...
CORR
2010
Springer
13 years 9 months ago
2010
Springer
Multiprocessor task scheduling is an important and computationally difficult problem. This paper proposes a comparison study of genetic algorithm and list scheduling algorithm. Bo...
SIGMOD
2010
ACM
13 years 7 months ago
2010
ACM
Tuning tools attempt to configure a database to achieve optimal performance for a given workload. Selecting an optimal set of physical structures is computationally hard since it ...