1477 search results - page 8 / 296 » Complexity of (iterated) dominance |
168
click to vote
CORR
2008
Springer
15 years 6 months ago
2008
Springer
The measure and conquer approach has proven to be a powerful tool to analyse exact algorithms for combinatorial problems, like Dominating Set and Independent Set. In this paper, we...
196
click to vote
ICTAI
2010
IEEE
15 years 4 months ago
2010
IEEE
A conversational recommender system iteratively shows a small set of options for its user to choose between. In order to select these options, the system may analyze the queries tr...
184
click to vote
GCC
2003
Springer
15 years 11 months ago
2003
Springer
— The peer-to-peer network for sharing information and data through direct exchange has emerged rapidly in recent years. The searching problem is a basic issue that addresses the...
120
click to vote
CAV
2006
Springer
15 years 9 months ago
2006
Springer
Abstract. The problem of finding a small unsatisfiable core of an unsatisfiable CNF formula is addressed. The proposed algorithm, Trimmer, iterates over each internal node d in the...
197
click to vote
SMA
2008
ACM
15 years 6 months ago
2008
ACM
In this paper we present a new algorithm which turns an unstructured triangle mesh into a quad-dominant mesh with edges aligned to the principal directions of the underlying geome...