4315 search results - page 214 / 863 » Sorting in linear time |
AAAI
2000
13 years 10 months ago
2000
We introduce new linear time algorithms for satisfiability of binary propositional theories (2-SAT), and for recognition and satisfiability of renamable Horn theories. The algorit...
COLOGNETWENTE
2009
13 years 10 months ago
2009
We present an efficient algorithm to find an optimal integer solution of a given system of 2-variable equalities and 1-variable inequalities with respect to a given linear objectiv...
CORR
2008
Springer
13 years 9 months ago
2008
Springer
In this paper we present an algorithmic framework for solving a class of combinatorial optimization problems on graphs with bounded pathwidth. The problems are NP-hard in general, ...
ISCAS
2005
IEEE
14 years 2 months ago
2005
IEEE
There are many ways to define richness of a discrete time signal. In this paper we consider a particular definition and explore the conditions under which a linear time invarian...
LATIN
2000
Springer
14 years 27 days ago
2000
Springer
The Flexible Job Shop problem is a generalization of the classical job shop scheduling problem in which for every operation there is a group of machines that can process it. The p...