394 search results - page 68 / 79 » Computing Minimal Polynomials of Matrices |
112
click to vote
MFCS
2004
Springer
15 years 5 months ago
2004
Springer
We study the problem of optimal preemptive scheduling with respect to a general target function. Given n jobs with associated weights and m ≤ n uniformly related machines, one a...
114
Voted
APPROX
2006
Springer
15 years 4 months ago
2006
Springer
Abstract. This paper investigates the relationship between the dimension theory of partial orders and the problem of scheduling precedenceconstrained jobs on a single machine to mi...
112
click to vote
AAAI
1996
15 years 1 months ago
1996
We present a connectionist architecture that supports almost instantaneous deductive and abductive reasoning. The deduction algorithm responds in few steps for single rule queries...
94
Voted
EOR
2007
15 years 12 days ago
2007
We consider a supply chain design problem where the decision maker needs to decide the number and locations of the distribution centers (DCs). Customers face random demand, and ea...
ANOR
2005
15 years 10 days ago
2005
: We consider in this paper a two-machine flowshop scheduling problem in which the first machine processes jobs individually while the second machine processes jobs in batches. The...