1289 search results - page 94 / 258 » Complexity of Counting the Optimal Solutions |
AIPS
2010
15 years 7 days ago
2010
Factored planning methods aim to exploit locality to efficiently solve large but "loosely coupled" planning problems by computing solutions locally and propagating limit...
GBRPR
2009
Springer
14 years 7 months ago
2009
Springer
In this paper, we present a novel graph construction method and demonstrate its usage in a broad range of applications starting from a relatively simple single-surface segmentation...
185
click to vote
INFOCOM
2011
IEEE
14 years 1 months ago
2011
IEEE
Abstract—Network-coded cooperative communications (NCCC) is a new paradigm in wireless networks that employs network coding (NC) to improve the performance of CC. The core mechan...
CSSE
2006
IEEE
14 years 10 months ago
2006
IEEE
The recent investigation of privacy-preserving data mining has been motivated by the growing concern about the privacy of individuals when their data is stored, aggregated, and mi...
129
click to vote
GECCO
2011
Springer
14 years 1 months ago
2011
Springer
In continuous optimisation, surrogate models (SMs) are used when tackling real-world problems whose candidate solutions are expensive to evaluate. In previous work, we showed that...