257 search results - page 36 / 52 » ai 2006 |
AI
2006
Springer
14 years 9 months ago
2006
Springer
Starting from some simple observations on a popular selection method in Evolutionary Algorithms (EAs)--tournament selection--we highlight a previously-unknown source of inefficien...
AI
2006
Springer
14 years 9 months ago
2006
Springer
Branch-and-bound and branch-and-cut use search trees to identify optimal solutions to combinatorial optimization problems. In this paper, we introduce an iterative search strategy...
104
click to vote
AI
2006
Springer
14 years 9 months ago
2006
Springer
In this paper we describe a machine learning approach for acquiring a model of a robot behaviour from raw sensor data. We are interested in automating the acquisition of behaviour...
100
Voted
AI
2006
Springer
14 years 9 months ago
2006
Springer
Evaluative arguments are pervasive in natural human communication. In countless situations people attempt to advise or persuade their interlocutors that something is desirable (vs...
75
Voted
AI
2006
Springer
14 years 9 months ago
2006
Springer
Deeper searches in game-playing programs relying on the minimax principle generally produce better results. Theoretical analyses, however, suggest that in many cases minimaxing am...