4066 search results - page 465 / 814 » Almost Complete Sets |
204
click to vote
LPAR
2010
Springer
15 years 6 months ago
2010
Springer
The Inst-Gen-Eq method is an instantiation-based calculus which is complete for first-order clause logic modulo equality. Its distinctive feature is that it combines first-order ...
206
click to vote
MICS
2010
15 years 6 months ago
2010
We study the preemptive scheduling problem of a set of n jobs with release times and equal processing times on a single machine. The objective is to minimize the sum of the weighte...
168
click to vote
OL
2010
15 years 6 months ago
2010
In an important paper, Burer [2] recently showed how to reformulate general mixed-binary quadratic optimization problems (QPs) into copositive programs where a linear functional i...
195
click to vote
ACL
2010
15 years 5 months ago
2010
In this paper we describe an intuitionistic method for dependency parsing, where a classifier is used to determine whether a pair of words forms a dependency edge. And we also pro...
222
click to vote
APN
2010
Springer
15 years 5 months ago
2010
Springer
Workflow mining is the task of automatically producing a workflow model from a set of event logs recording sequences of workflow events; each sequence corresponds to a use case or ...