13026 search results - page 2248 / 2606 » Creativity and Artificial Intelligence |
200
Voted
AI
2006
Springer
15 years 7 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...
212
click to vote
AI
2006
Springer
15 years 7 months ago
2006
Springer
Coalition formation is a key problem in automated negotiation among self-interested agents, and other multiagent applications. A coalition of agents can sometimes accomplish thing...
230
click to vote
AI
2006
Springer
15 years 7 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...
189
click to vote
AI
2006
Springer
15 years 7 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...
210
click to vote
AI
2006
Springer
15 years 7 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...