360 search results - page 37 / 72 » Taxonomy of Improvement Operators and the Problem of Minimal... |
ICTAI
2005
IEEE
14 years 2 months ago
2005
IEEE
In this paper, we study strategies in incremental planning for ordering and grouping subproblems partitioned by the subgoals of a planning problem when each subproblem is solved b...
GECCO
2010
Springer
14 years 11 days ago
2010
Springer
We use affine arithmetic to improve both the performance and the robustness of genetic programming for symbolic regression. During evolution, we use affine arithmetic to analyze e...
USENIX
2008
13 years 11 months ago
2008
In many of today's applications, access to storage constitutes the major cost of processing a user request. Data prefetching has been used to alleviate the storage access lat...
FCCM
2004
IEEE
14 years 23 days ago
2004
IEEE
Dynamically reconfigurable architectures or systems are able to reconfigure their function and/or structure to suit changing needs of a computation during run time. The increasing...
ICTAI
2010
IEEE
13 years 7 months ago
2010
IEEE
The balanced graph partitioning consists in dividing the vertices of an undirected graph into a given number of subsets of approximately equal size, such that the number of edges c...