prolog 找路例子程序：
=== === === === === ===
Part 1-Adding connections
Part 2-Simple Path
example
| ?- path1(a,b,P,T).
will produce the response:
T = 15
P = [a,b] ?
Part 3 - Non-repeating path
As an example, the query:
?- path2(a,h,P,T).
will succeed and may produce the bindings:
P = [a,depot,b,d,e,f,h]
T = 155
Part 4 - Generating a path below a cost threshold
As an example, the query:
?- path_below_cost(a,[a,b,c,d,e,f,g,h],RS,300).
returns:
RS = [a,b,depot,c,d,e,g,f,h] ?
RS = [a,c,depot,b,d,e,g,f,h] ?
no
==================================
標(biāo)簽：
Part
connections
example
prolog
上傳時間：
2015-04-24
上傳用戶：ljt101007
- XCS for Dynamic Environments
+ Continuous versions of XCS
+ Test problem: real multiplexer
+ Experiments: XCS is explored in dynamic environments with different magnitudes of change to the underlying concepts.
+Reference papers:
H.H. Dam, H.A. Abbass, C.J. Lokan, Evolutionary Online Data Mining – an Investigation in a Dynamic Environment. 2005, accepted for a book chapter in Springer Series on Studies in Computational Intelligence
H.H. Dam, H.A. Abbass, C.J. Lokan, Be Real! XCS with Continuous-Valued Inputs. IWLCS 2005, (International Workshop on Learning Classifier Systems). Washington DC, June 2005.
標(biāo)簽：
Environments
multiplexer
Continuous
XCS
上傳時間：
2015-07-04
上傳用戶：Avoid98
