9842 search results - page 377 / 1969 » The Complexity of the Matching-Cut Problem |
162
click to vote
ITS
2004
Springer
15 years 9 months ago
2004
Springer
This research describes a probabilistic approach for developing predictive models of how students learn problem-solving skills in general qualitative chemistry. The goal is to use ...
141
click to vote
RTSS
2003
IEEE
15 years 9 months ago
2003
IEEE
The Pfair algorithms are optimal for independent periodic real-time tasks executing on a multiple-resource system, however, they incur a high scheduling overhead by making schedul...
129
click to vote
STOC
2010
ACM
16 years 1 months ago
2010
ACM
We initiate a direction for proving lower bounds on the size of non-commutative arithmetic circuits. This direction is based on a connection between lower bounds on the size of no...
132
click to vote
EVOW
2006
Springer
15 years 8 months ago
2006
Springer
Abstract. We introduce a novel representation for the graph colouring problem, called the Integer Merge Model, which aims to reduce the time complexity of an algorithm. Moreover, o...
146
click to vote
ECCV
2010
Springer
15 years 5 months ago
2010
Springer
Abstract. We consider the minimization of a smooth convex function regularized by the mixture of prior models. This problem is generally difficult to solve even each simpler regula...