100 search results - page 1 / 20 » Towards a Structured Analysis of Approximate Problem Solving... |
KR
2004
Springer
13 years 9 months ago
2004
Springer
GECCO
2006
Springer
13 years 8 months ago
2006
Springer
Recently, studies with the XCS classifier system on Boolean functions have shown that in certain types of functions simple crossover operators can lead to disruption and, conseque...
ICFP
2003
ACM
14 years 4 months ago
2003
ACM
Under the widely believed conjecture P=NP, NP-complete problems cannot be solved exactly using efficient polynomial time algorithms. Furthermore, any instance of a NP-complete pro...
ICONFERENCE
2011
12 years 11 months ago
2011
To develop a science of small-group interaction in groupware, we need a method for analyzing the structure of computer-mediated discourse. Conversation analysis offers an analysis...
AIIA
1991
Springer
13 years 7 months ago
1991
Springer
The use of approximation as a method for dealing with complex problems is a fundamental research issue in Knowledge Representation. Using approximation in symbolic AI is not strai...