9842 search results - page 395 / 1969 » The Complexity of the Matching-Cut Problem |
140
click to vote
COR
2008
15 years 4 months ago
2008
We consider the problem of ranking assignments according to cost in the classical linear assignment problem. An algorithm partitioning the set of possible assignments, as suggeste...
109
click to vote
ICONIP
2009
15 years 2 months ago
2009
We study a subclass of POMDPs, called quasi-deterministic POMDPs (QDET-POMDPs), characterized by deterministic actions and stochastic observations. While this framework does not mo...
172
click to vote
JMLR
2010
14 years 11 months ago
2010
Identifying a subset of features that preserves classification accuracy is a problem of growing importance, because of the increasing size and dimensionality of real-world data se...
181
click to vote
ICANN
2011
Springer
14 years 8 months ago
2011
Springer
Abstract. This paper presents a neural network tree regression system with dynamic optimization of input variable transformations and post-training optimization. The decision tree ...
160
click to vote
EUROSYS
2006
ACM
16 years 1 months ago
2006
ACM
Run-time conflicts can affect even the most rigorously tested software systems. A reliance on execution-based testing makes it prohibitively costly to test every possible interac...