3250 search results - page 313 / 650 » Parameterized Learning Complexity |
145
click to vote
CPAIOR
2009
Springer
15 years 11 months ago
2009
Springer
Abstract. In constraint programming there are often many choices regarding the propagation method to be used on the constraints of a problem. However, simple constraint solvers usu...
123
click to vote
SIGECOM
2009
ACM
15 years 11 months ago
2009
ACM
Policy teaching considers a Markov Decision Process setting in which an interested party aims to influence an agent’s decisions by providing limited incentives. In this paper, ...
132
click to vote
FOCS
2008
IEEE
15 years 11 months ago
2008
IEEE
We study the problem of finding the minimum size DNF formula for a function f : {0, 1}d → {0, 1} given its truth table. We show that unless NP ⊆ DTIME(npoly(log n) ), there i...
162
click to vote
ICPP
2008
IEEE
15 years 11 months ago
2008
IEEE
Despite great efforts on the design of ultra-reliable components, the increase of system size and complexity has outpaced the improvement of component reliability. As a result, fa...
133
click to vote
AGILEDC
2007
IEEE
15 years 11 months ago
2007
IEEE
This report examines how the VeriSign Managed Security Services team (MSS) has successfully extended agile software development practices to deal with a complex, multi-product dev...