2413 search results - page 135 / 483 » Understanding the problem |
135
click to vote
GECCO
2006
Springer
15 years 6 months ago
2006
Springer
Metaheuristics have often been shown to be effective for difficult combinatorial optimization problems. The reason for that, however, remains unclear. A framework for a theory of ...
108
click to vote
ICRA
1994
IEEE
15 years 6 months ago
1994
IEEE
Analysis and simulations are performed for a simplified model of a commercially available variant on the skateboard, known as the Snakeboard1 . Although the model exhibits basic g...
AAAI
2008
15 years 5 months ago
2008
To truly understand language, an intelligent system must be able to connect words, phrases, and sentences to its perception of objects and events in the world. Current natural lan...
133
click to vote
INCDM
2010
Springer
15 years 5 months ago
2010
Springer
Defining the boundaries of a web-site, for (say) archiving or information retrieval purposes, is an important but complicated task. In this paper a web-page clustering approach to...
139
click to vote
AAAI
2004
15 years 4 months ago
2004
Tabu search algorithms are amongst the most successful local search based methods for the maximum satisfiability problem. The practical superiority of tabu search over the local s...