2446 search results - page 45 / 490 » Choiceless Polynomial Time |
RTCSA
2005
IEEE
14 years 1 months ago
2005
IEEE
In some real-time application systems, there are only a few distinct kinds of tasks, each of which may be instantiated several times during runtime. The scheduling of such sporadi...
PPAM
2001
Springer
14 years 1 days ago
2001
Springer
Abstract. This paper investigates the complexity of scheduling biprocessor tasks on dedicated processors to minimize mean flow time. Since the general problem is strongly NP-hard,...
FAW
2009
Springer
14 years 2 months ago
2009
Springer
We give a linear-time algorithm for computing the edge search number of cographs, thereby proving that this problem can be solved in polynomial time on this graph class. With our ...
HYBRID
2009
Springer
14 years 2 months ago
2009
Springer
We show that regarding finite automata (FA) as discrete, time-invariant linear systems over semimodules, allows to: (1) express FA minimization and FA determinization as particula...
CEC
2009
IEEE
14 years 2 months ago
2009
IEEE
—Univariate Marginal Distribution Algorithms (UMDAs) are a kind of Estimation of Distribution Algorithms (EDAs) which do not consider the dependencies among the variables. In thi...