1679 search results - page 47 / 336 » Strong order equivalence |
RTAS
2010
IEEE
13 years 8 months ago
2010
IEEE
Abstract—Recent results have shown that the feasibility problem of scheduling periodic tasks with self-suspensions is NPhard in the strong sense. We observe that a variation of t...
ORDER
2006
13 years 9 months ago
2006
We say that a countable linear ordering L is countably complementable if there exists a linear ordering L, possibly uncountable, such that for any countable linear ordering B, L do...
AML
2000
13 years 9 months ago
2000
We study a local version of the order property in several frameworks, with an emphasis on frameworks where the compactness theorem fails: (1) Inside a fixed model, (2) for classes ...
DAM
2008
13 years 10 months ago
2008
: We consider a problem of searching an element in a partially ordered set (poset). The goal is to find a search strategy which minimizes the number of comparisons. Ben-Asher, Farc...
KR
2004
Springer
14 years 3 months ago
2004
Springer
Disjunction is generally considered to add expressive power to logic programs under the stable model semantics, which have become a popular programming paradigm for knowledge repr...