4218 search results - page 305 / 844 » Complete sets of cooperations |
190
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...
151
click to vote
RECOMB
2000
Springer
15 years 9 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...
163
click to vote
AAAI
2008
15 years 8 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...
167
click to vote
DLOG
2007
15 years 8 months ago
2007
Abstract. In this paper, we propose an approach to translating any ALC ontology (possible inconsistent) into a logically consistent set of disjunctive datalog rules. We achieve thi...
160
click to vote
CADE
2008
Springer
15 years 8 months ago
2008
Springer
We describe the new software package Aligator for automatically inferring polynomial loop invariants. The package combines algorithms from symbolic summation and polynomial algebra...