388 search results - page 12 / 78 » Improving Exact Algorithms for MAX-2-SAT |
IJBC
2007
13 years 8 months ago
2007
A Chaitin Omega number is the halting probability of a universal prefix-free Turing machine. Every Omega number is simultaneously computably enumerable (the limit of a computable...
DAC
1999
ACM
14 years 9 months ago
1999
ACM
Finding the minimum column multiplicity for a bound set of variables is an important problem in Curtis decomposition. To investigate this problem, we compared two graphcoloring pr...
MTA
2007
13 years 8 months ago
2007
In this paper, we proposed an improved “bottom-up” variable-size block matching method. Different from previous work, the proposed method does not need any threshold during th...
DAC
1994
ACM
14 years 28 days ago
1994
ACM
In current research, the minimum cycle times of finite state machines are estimated by computing the delays of the combinational logic in the finite state machines. Even though th...
COMGEO
2010
ACM
13 years 9 months ago
2010
ACM
r Numerical Abstractions6 Roberto Bagnaraa , Patricia M. Hillb , Enea Zaffanellaa aDepartment of Mathematics, University of Parma, Italy bSchool of Computing, University of Leeds, ...