67 search results - page 4 / 14 » Solving MAX-r-SAT Above a Tight Lower Bound |
ISSS
2000
IEEE
15 years 1 months ago
2000
IEEE
This paper addresses the problem of estimating lower bounds on the power consumption in scheduled data flow graphs with a fixed number of allocated resources prior to binding. T...
DAGSTUHL
2006
14 years 10 months ago
2006
In this paper we study a class of dynamical systems defined by Pfaffian maps. It is a sub-class of o-minimal dynamical systems which capture rich continuous dynamics and yet can be...
SODA
2010
ACM
15 years 6 months ago
2010
ACM
Many NP-hard problems can be solved efficiently when the input is restricted to graphs of bounded tree-width or clique-width. In particular, by the celebrated result of Courcelle,...
STACS
1999
Springer
15 years 1 months ago
1999
Springer
Abstract. In this we paper we consider the version of the classical Towers of Hanoi games where the game-board contains more than three pegs. For k pegs we give a 2Ckn1/(k−2) low...
JCSS
2008
14 years 9 months ago
2008
We provide a characterization of the resolution width introduced in the context of propositional proof complexity in terms of the existential pebble game introduced in the context...