1523 search results - page 103 / 305 » Partially ordered secretaries |
EOR
2007
15 years 20 days ago
2007
The knapsack problem (KP) is generalized to the case where items are partially ordered through a set of precedence relations. As in ordinary KPs, each item is associated with proï...
100
Voted
ACS
2004
15 years 18 days ago
2004
Inthis article westudy the fundamental category (Goubault and Raussen, 2002 Goubault, 2002) of a partially ordered topological space (Nachbin, 1965 Johnstone, 1982), as arising in ...
78
Voted
CORR
2010
Springer
15 years 9 days ago
2010
Springer
An -tree-automatic structure is a relational structure whose domain and relations are accepted by Muller or Rabin tree automata. We investigate in this paper the isomorphism probl...
PVLDB
2008
15 years 6 days ago
2008
Current skyline evaluation techniques assume a fixed ordering on the attributes. However, dynamic preferences on nominal attributes are more realistic in known applications. In or...
109
click to vote
CAP
2010
14 years 7 months ago
2010
Computing the minimal elements of a partially ordered finite set (poset) is a fundamental problem in combinatorics with numerous applications such as polynomial expression optimiz...