667 search results - page 98 / 134 » Exceptions for Algorithmic Skeletons |
CORR
2011
Springer
13 years 3 months ago
2011
Springer
Ontologies and rules are usually loosely coupled in knowledge representation formalisms. In fact, ontologies use open-world reasoning while the leading semantics for rules use non...
SIAMNUM
2010
13 years 3 months ago
2010
Two algorithms based upon a tree-cotree decomposition, called in this paper spanning tree technique (STT) and generalized spanning tree technique (GSTT), have been shown to be usef...
STOC
2012
ACM
11 years 11 months ago
2012
ACM
d abstract; full version begins on page 13) Ryan O’Donnell∗ John Wright† November 2, 2011 We show that distinguishing 1 2 -satisfiable Unique-Games instances from (3 8 + )-...
CORR
2010
Springer
13 years 8 months ago
2010
Springer
We consider the question of the stability of evolutionary algorithms to gradual changes, or drift, in the target concept. We define an algorithm to be resistant to drift if, for s...
SODA
2012
ACM
11 years 11 months ago
2012
ACM
Bidimensionality theory was introduced by Demaine et al. [JACM 2005 ] as a framework to obtain algorithmic results for hard problems on minor closed graph classes. The theory has ...