Sciweavers

400 search results - page 12 / 80
» What Makes a Problem GP-Hard
Sort
View
CCIA
2005
Springer
14 years 28 days ago
Using symbolic descriptions to explain similarity on CBR
The explanation of the results is a key point of automatic problem solvers. CBR systems solve a new problem by assessing its similarity with already solved cases and they commonly ...
Eva Armengol, Enric Plaza
SIGUCCS
2003
ACM
14 years 19 days ago
Being Sam Malone: customer service on a campus where "Everybody Knows Your Name"
Working on a small campus has many advantages: Familiarity with the majority of faculty and staff, in-depth knowledge of how systems interact, adding the personal touch to each in...
Mark Watts
SIGSOFT
1994
ACM
13 years 11 months ago
Foundations of Software Testing: Dependability Theory
Testing is potentially the best grounded part of software engineering, since it deals with the well defined situation of a fixed program and a test (a finite collection of input v...
Richard G. Hamlet
AIR
2008
97views more  AIR 2008»
13 years 7 months ago
A design framework for metaheuristics
This paper is concerned with taking an engineering approach towards the application of metaheuristic problem solving methods, i.e. heuristics that aim to solve a wide variety of p...
Colin G. Johnson
IJIT
2004
13 years 8 months ago
Memetic Algorithm Based Path Planning for a Mobile Robot
In this paper, the problem of finding the optimal collision free path for a mobile robot, the path planning problem, is solved using an advanced evolutionary algorithm called memet...
Neda Shahidi, Hadi Esmaeilzadeh, Marziye Abdollahi...