2747 search results - page 251 / 550 » Non-oblivious Strategy Improvement |
193
click to vote
JSSPP
2005
Springer
16 years 4 days ago
2005
Springer
The recent success of Internet-based computing projects, coupled with rapid developments in peer-to-peer systems, has stimulated interest in the notion of harvesting idle cycles u...
144
click to vote
GECCO
2004
Springer
16 years 14 hour ago
2004
Springer
Traditionally, the mutation rates of genetic algorithms are fixed or decrease over the generations. Although it seems to be reasonable for classical genetic algorithms, it may not...
203
click to vote
CASES
2003
ACM
15 years 12 months ago
2003
ACM
Bank locality can be defined as localizing the number of load/store accesses to a small set of memory banks at a given time. An optimizing compiler can modify a given input code t...
169
click to vote
ERSHOV
1999
Springer
15 years 11 months ago
1999
Springer
Abstract. Existing partial evaluators usually fix the strategy for binding-time analysis. But a single strategy cannot fulfill all goals without leading to compromises regarding ...
146
click to vote
IPPS
1998
IEEE
15 years 11 months ago
1998
IEEE
The Loop-Level Process Control LLPC policy 9 dynamically adjusts the number of threads an application is allowed to execute based on the application's available parallelism a...