2446 search results - page 426 / 490 » Choiceless Polynomial Time |
INFOCOM
1995
IEEE
13 years 11 months ago
1995
IEEE
In communication networks, a large number of alarms exist to signal any abnormal behavior of the network. As network faults typically result in a number of alarms, correlating the...
CAV
2010
Springer
13 years 11 months ago
2010
Springer
Often one has a preference order among the different systems that satisfy a given specification. Under a probabilistic assumption about the possible inputs, such a preference order...
CVPR
2009
IEEE
13 years 11 months ago
2009
IEEE
In this paper general solutions for Nonlinear Nonnegative Component Analysis for data representation and recognition are proposed. That is, motivated by a combination of the Nonne...
AIPS
2010
13 years 10 months 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...
AAAI
2008
13 years 10 months ago
2008
Heuristic search using algorithms such as A and IDA is the prevalent method for obtaining optimal sequential solutions for classical planning tasks. Theoretical analyses of these ...