5675 search results - page 98 / 1135 » Exploiting Chaos for Computation |
102
Voted
CP
2007
Springer
15 years 7 months ago
2007
Springer
It has recently been shown, for the Constraint Satisfaction Problem (CSP), that the state associated with a node of the search tree built by a backtracking algorithm can be exploit...
111
Voted
GECCO
2005
Springer
15 years 6 months ago
2005
Springer
Various multi–objective evolutionary algorithms (MOEAs) have obtained promising results on various numerical multi– objective optimization problems. The combination with gradi...
118
Voted
PCI
2005
Springer
15 years 6 months ago
2005
Springer
Cache misses form a major bottleneck for memory-intensive applications, due to the significant latency of main memory accesses. Loop tiling, in conjunction with other program tran...
112
click to vote
PCM
2005
Springer
15 years 6 months ago
2005
Springer
In this paper, attention is paid to the automatic generation of XML-based descriptions containing information about the high-level structure of binary multimedia resources. These s...
IFL
2004
Springer
2004
Springer
Exploiting Single-Assignment Properties to Optimize Message-Passing Programs by Code Transformations
15 years 6 months ago
The message-passing paradigm is now widely accepted and used mainly for inter-process communication in distributed memory parallel systems. However, one of its disadvantages is the...