1743 search results - page 140 / 349 » Generalized Modal Satisfiability |
108
Voted
DAC
2002
ACM
16 years 4 months ago
2002
ACM
We have developed a generic integer linear programming(ILP)based engineering change(EC) methodology. The EC methodology has three components: enabling, fast, and preserving. Enabl...
114
click to vote
TPDS
2010
15 years 1 months ago
2010
—Considering an asynchronous system made up of n processes and where up to t of them can crash, finding the weakest assumption that such a system has to satisfy for a common lea...
132
Voted
AAAI
2006
15 years 4 months ago
2006
Random problem distributions have played a key role in the study and design of algorithms for constraint satisfaction and Boolean satisfiability, as well as in our understanding o...
158
Voted
COMBINATORICA
2010
14 years 10 months ago
2010
We prove that the edges of every graph of bounded (Euler) genus can be partitioned into any prescribed number k of pieces such that contracting any piece results in a graph of bou...
116
Voted
CVPR
2005
IEEE
16 years 5 months ago
2005
IEEE
This paper presents an axiomatic approach to corner detection. In the first part of the paper we review five currently used corner detection methods (Harris-Stephens, F?orstner, S...