Sciweavers

9849 search results - page 1717 / 1970
» Algorithms and Experiments for the Webgraph
Sort
View
IJSYSC
2000
74views more  IJSYSC 2000»
15 years 6 months ago
Towards the evolutionary emergence of increasingly complex advantageous behaviours
The generation of complex entities with advantageous behaviours beyond our manual design capability requires long-term incremental evolution with continuing emergence. In this pap...
A. D. Channon, Robert I. Damper
EOR
2002
74views more  EOR 2002»
15 years 6 months ago
Modeling multistage cutting stock problems
In multistage cutting stock problems (CSP) the cutting process is distributed over several successive stages. Every stage except the last one produces intermediate products. The l...
Eugene J. Zak
ESWA
2002
89views more  ESWA 2002»
15 years 6 months ago
A parallelized indexing method for large-scale case-based reasoning
Case-based reasoning (CBR) is a commonly seen problem-solving methodology in artificial intelligence. It can correctly take advantage of the situations and methods in former cases...
Wei-Chou Chen, Shian-Shyong Tseng, Lu-Ping Chang, ...
JGAA
2000
85views more  JGAA 2000»
15 years 6 months ago
Techniques for the Refinement of Orthogonal Graph Drawings
Current orthogonal graph drawing algorithms produce drawings which are generally good. However, many times the quality of orthogonal drawings can be significantly improved with a ...
Janet M. Six, Konstantinos G. Kakoulis, Ioannis G....
ML
2000
ACM
126views Machine Learning» more  ML 2000»
15 years 6 months ago
Learning to Play Chess Using Temporal Differences
In this paper we present TDLEAF( ), a variation on the TD( ) algorithm that enables it to be used in conjunction with game-tree search. We present some experiments in which our che...
Jonathan Baxter, Andrew Tridgell, Lex Weaver
« Prev « First page 1717 / 1970 Last » Next »