Sciweavers

3241 search results - page 307 / 649
» Challenges for Dataset Search
Sort
View
AAAI
2007
15 years 8 months ago
Refutation by Randomised General Resolution
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...
Steven David Prestwich, Inês Lynce
AIPS
2007
15 years 8 months ago
Concurrent Probabilistic Temporal Planning with Policy-Gradients
We present an any-time concurrent probabilistic temporal planner that includes continuous and discrete uncertainties and metric functions. Our approach is a direct policy search t...
Douglas Aberdeen, Olivier Buffet
CIKM
2008
Springer
15 years 7 months ago
Estimating the number of answers with guarantees for structured queries in p2p databases
Structured P2P overlays supporting standard database functionalities are a popular choice for building large-scale distributed data management systems. In such systems, estimating...
Marcel Karnstedt, Kai-Uwe Sattler, Michael Ha&szli...
ICML
2010
IEEE
15 years 6 months ago
Feature Selection as a One-Player Game
This paper formalizes Feature Selection as a Reinforcement Learning problem, leading to a provably optimal though intractable selection policy. As a second contribution, this pape...
Romaric Gaudel, Michèle Sebag
AIPS
2010
15 years 5 months ago
Waking Up a Sleeping Rabbit: On Natural-Language Sentence Generation with FF
We present a planning domain that encodes the problem of generating natural language sentences. This domain has a number of features that provoke fairly unusual behavior in planne...
Alexander Koller, Joerg Hoffmann