4066 search results - page 299 / 814 » Almost Complete Sets |
140
click to vote
RTA
2010
Springer
15 years 10 months ago
2010
Springer
Abstract. We extend first-order order-sorted unification by permitting regular expression sorts for variables and in the domains of function symbols. The set of basic sorts is ...
158
click to vote
FOSSACS
2004
Springer
15 years 10 months ago
2004
Springer
In this paper we present a theorem for defining fixed-points in categories of sheaves. This result gives a unifying and general account of most techniques used in computer science ...
201
click to vote
ESA
2000
Springer
15 years 10 months ago
2000
Springer
We consider the problem of preemptively scheduling a set of n jobs on m (identical, uniformly related, or unrelated) parallel machines. The scheduler may reject a subset of the job...
160
click to vote
RECOMB
2000
Springer
15 years 10 months ago
2000
Springer
We present a general heuristicfor the median problem for induced breakpoints on genomes with unequal gene content and incorporate this into a routine for estimating optimal gene o...
173
click to vote
AAAI
2008
15 years 9 months ago
2008
We formulate loop formulas for logic programs with arbitrary constraint atoms, for the semantics based on conditional satisfaction. This provides a method for answer set computati...