2457 search results - page 473 / 492 » Local Search with Bootstrapping |
AGENTS
2001
Springer
14 years 1 months ago
2001
Springer
Multi-Agent Systems are a promising way of dealing with large complex problems. However, it is not yet clear just how much complexity or pre-existing structure individual agents m...
WDAG
2001
Springer
14 years 27 days ago
2001
Springer
Abstract. The ability to cooperate on common tasks in a distributed setting is key to solving a broad range of computation problems ranging from distributed search such as SETI to ...
IPPS
2000
IEEE
14 years 26 days ago
2000
IEEE
To solve real-world discrete optimization problems approximately metaheuristics such as simulated annealing and other local search methods are commonly used. For large instances o...
SIGMETRICS
1998
ACM
14 years 21 days ago
1998
ACM
Modern disk drives read-ahead data and reorder incoming requests in a workload-dependent fashion. This improves their performance, but makes simple analytical models of them inade...
KDD
1998
ACM
14 years 21 days ago
1998
ACM
We consider the problem of nding rules relating patterns in a time series to other patterns in that series, or patterns in one series to patterns in another series. A simple examp...