2263 search results - page 285 / 453 » On learning in agent-centered search |
136
click to vote
AAAI
2007
15 years 8 months ago
2007
Local search is widely applied to satisfiable SAT problems, and on some problem classes outperforms backtrack search. An intriguing challenge posed by Selman, Kautz and McAlleste...
179
click to vote
FLAIRS
2007
15 years 8 months ago
2007
Currently, among the fastest approaches to AI task planning we find many forward-chaining heuristic planners, as FF. Most of their good performance comes from the use of domain-i...
172
click to vote
EMNLP
2007
15 years 8 months ago
2007
We present a new approach to automatic summarization based on neural nets, called NetSum. We extract a set of features from each sentence that helps identify its importance in the...
192
click to vote
IADIS
2008
15 years 8 months ago
2008
Multi-relational data mining has become popular due to the limitations of propositional problem definition in structured domains and the tendency of storing data in relational dat...
264
click to vote
AIPS
2004
15 years 8 months ago
2004
Oversubscribed scheduling problems require removing tasks when enough resources are not available. Prior AI approaches have mostly been constructive or repairbased heuristic searc...