2657 search results - page 80 / 532 » On the complexity of hierarchical problem solving |
149
click to vote
IWPEC
2010
Springer
14 years 11 months ago
2010
Springer
We consider the computational complexity of a problem modeling bribery in the context of voting systems. In the scenario of Swap Bribery, each voter assigns a certain price for swa...
103
Voted
CORR
2010
Springer
15 years 1 months ago
2010
Springer
While much work on learning in planning focused on learning domain physics (i.e., action models), and search control knowledge, little attention has been paid towards learning use...
MFCS
2007
Springer
15 years 7 months ago
2007
Springer
We resolve the computational complexity of determining the treelength of a graph, thereby solving an open problem of Dourisboure and Gavoille, who introduced this parameter, and a...
107
click to vote
ICML
2006
IEEE
16 years 2 months ago
2006
IEEE
Knowledge-based planning methods offer benefits over classical techniques, but they are time consuming and costly to construct. There has been research on learning plan knowledge ...
108
click to vote
ACSD
2005
IEEE
15 years 7 months ago
2005
IEEE
We consider the distributed implementability problem as: Given a labeled transition system TS together with a distribution ∆ of its actions over a set of processes, does there ex...