4894 search results - page 693 / 979 » Dynamic Abstraction Planning |
146
click to vote
PPSN
1998
Springer
15 years 11 months ago
1998
Springer
Abstract. In order to escape from local optima, it is standard practice to periodically restart a genetic algorithm according to some restart criteria/policy. This paper addresses ...
199
click to vote
ICPP
1997
IEEE
15 years 11 months ago
1997
IEEE
Abstract—This paper describes an algorithm for deriving data and computation partitions on scalable shared memory multiprocessors. The algorithm establishes affinity relationshi...
163
click to vote
INFOCOM
1997
IEEE
15 years 11 months ago
1997
IEEE
Abstract—Dynamic routing has been adopted in circuit-switched networks in many parts of the world. Most of the routing algorithms used are least loaded routing (LLR) based for it...
151
click to vote
IUI
1997
ACM
15 years 11 months ago
1997
ACM
We are developing an Intelligent Network News Reader which extracts news articles for users. In contrast to ordinary information retrieval and abstract generation, this method uti...
175
click to vote
ICPP
1996
IEEE
15 years 11 months ago
1996
IEEE
A primary problem in the performance measurement of high-level parallel programming languages is to map lowlevel events to high-level programming constructs. We discuss several as...