Abstract—Engineering cannot wait until all phenomena are explained. Engineers may work effectively, often for centuries, with heuristics. This paper provides thirty one heuristic...
The existence of optimal algorithms is not known for any decision problem in NP \ P. We consider the problem of testing the membership in the image of an injective function. We co...
Edward A. Hirsch, Dmitry Itsykson, Valeria Nikolae...
: In this paper, we study the job shop scheduling problem with the objective of minimizing the total weighted tardiness. We propose a hybrid shifting bottleneck - tabu search (SB-T...
Current evaluation functions for heuristic planning are expensive to compute. In numerous planning problems these functions provide good guidance to the solution, so they are wort...
- In this work we are analyzing scalability of the heuristic algorithm we used in the past [1-4] to discover knowledge from multi-valued symbolic attributes in fuzzy databases. The...