1650 search results - page 183 / 330 » The HOM problem is decidable |
141
click to vote
JSC
2010
15 years 3 months ago
2010
The topic of this article is decision procedures for satisfiability modulo theories (SMT) of arbitrary quantifier-free formulæ. We propose an approach that decomposes the formu...
131
click to vote
LPAR
2010
Springer
15 years 3 months ago
2010
Springer
We consider two-player zero-sum games on graphs. On the basis of the information available to the players these games can be classified as follows: (a) partial-observation (both p...
122
click to vote
TCS
2010
15 years 2 months ago
2010
Motivated by applications that require mechanisms for describing the structure of object-oriented programs, adaptive star grammars are introduced, and their fundamental properties...
151
Voted
BMVC
2010
15 years 2 months ago
2010
We propose a novel general framework with a boosting algorithm to achieve active object classification by view selection. The proposed framework actively decides the next best vie...
164
click to vote
ESA
2010
Springer
15 years 2 months ago
2010
Springer
Abstract. We prove that for every graph H, there exists a polynomial-time algorithm deciding if a planar graph can be contracted to H. We introduce contractions and topological min...