Sciweavers

1523 search results - page 51 / 305
» Partially ordered secretaries
Sort
View
TPHOL
1995
IEEE
15 years 4 months ago
HOLCF: Higher Order Logic of Computable Functions
This paper presents a survey of HOLCF, a higher order logic of computable functions. The logic HOLCF is based on HOLC, a variant of the well known higher order logic HOL, which o e...
Franz Regensburger
113
Voted
EJC
2008
15 years 19 days ago
Generalised dualities and maximal finite antichains in the homomorphism order of relational structures
The motivation for this paper is three-fold. First, we study the connectivity properties of the homomorphism order of directed graphs, and more generally for relational structures...
Jan Foniok, Jaroslav Nesetril, Claude Tardif
76
Voted
GECCO
2003
Springer
15 years 5 months ago
An Evolutionary Algorithm for the Joint Replenishment of Inventory with Interdependent Ordering Costs
The joint replenishment of inventory problem (JRP) requires independence of minor ordering costs. In this paper we propose an evolutionary algorithm (EA) for a modification of the...
Anne L. Olsen
ISMIS
2000
Springer
15 years 4 months ago
Top-Down Query Processing in First Order Deductive Databases under the DWFS
A top-down query processing method for first order deductive databases under the disjunctive well-founded semantics (DWFS) is presented. The method is based upon a characterisation...
C. A. Johnson
DLOG
2007
15 years 2 months ago
On Ordering Descriptions in a Description Logic
We introduce a description language for specifying partial ordering relations over concept descriptions in description logics, and show how the language can be used in combination ...
Jeffrey Pound, Lubomir Stanchev, David Toman, Gran...