Sciweavers

4488 search results - page 95 / 898
» Focusing Search by Using Problem Solving Experience
Sort
View
IPPS
1999
IEEE
15 years 7 months ago
A Performance Model of Speculative Prefetching in Distributed Information Systems
Previous studies in speculative prefetching focus on building and evaluating access models for the purpose of access prediction. This paper investigates a complementary area which...
Nor Jaidi Tuah, Mohan Kumar, Svetha Venkatesh
AIA
2006
15 years 4 months ago
Speeding Up Model-based Diagnosis by a Heuristic Approach to Solving SAT
Model-based diagnosis of technical systems requires both a simulation machinery and a logic calculus. The former is responsible for the system's behavior analysis, the latter...
Benno Stein, Oliver Niggemann, Theodor Lettmann
GECCO
2003
Springer
148views Optimization» more  GECCO 2003»
15 years 8 months ago
Ant Colony Programming for Approximation Problems
Abstract. A method of automatic programming, called genetic programming, assumes that the desired program is found by using a genetic algorithm. We propose an idea of ant colony pr...
Mariusz Boryczka, Zbigniew J. Czech, Wojciech Wiec...
GECCO
2010
Springer
248views Optimization» more  GECCO 2010»
15 years 6 months ago
Integrating decision space diversity into hypervolume-based multiobjective search
Multiobjective optimization in general aims at learning about the problem at hand. Usually the focus lies on objective space properties such as the front shape and the distributio...
Tamara Ulrich, Johannes Bader, Eckart Zitzler
CP
2003
Springer
15 years 8 months ago
Using the Breakout Algorithm to Identify Hard and Unsolvable Subproblems
Abstract. Local search algorithms have been very successful for solving constraint satisfaction problems (CSP). However, a major weakness has been that local search is unable to de...
Carlos Eisenberg, Boi Faltings