3758 search results - page 221 / 752 » A Complete Subsumption Algorithm |
101
click to vote
ANTS
1994
Springer
15 years 6 months ago
1994
Springer
In this paper we give some computational results on the multiplicative orders of optimal normal basis generators in F2n over F2 for n 1200 whenever the complete factorization of 2...
130
Voted
EPIA
1993
Springer
15 years 6 months ago
1993
Springer
Abstract. This work presents a constraint solver for the domain of rational trees. Since the problem is NP-hard the strategy used by the solver is to reduce as much as possible, in...
114
click to vote
EURODAC
1990
IEEE
15 years 6 months ago
1990
IEEE
: In this paper logical cells and algorithms are presented supporting the design of pseudo-exhaustively testable circuits. The approach is based on real hardware segmentation, inst...
100
click to vote
ALDT
2009
Springer
15 years 6 months ago
2009
Springer
We study the problem of allocating a set of indivisible goods to a set of agents having additive preferences. We introduce two new important complexity results concerning efficienc...
146
click to vote
ESA
2000
Springer
15 years 6 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...