Sciweavers

1095 search results - page 7 / 219
» Preprocessing of Intractable Problems
Sort
View
MICAI
2004
Springer
14 years 1 months ago
A Preprocessing That Combines Heuristic and Surrogate Constraint Analysis to Fix Variables in TSP
A preprocessing procedure that uses a local guided search defined in terms of a neighborhood structure to get a feasible solution (UB) and the Osorio and Glover[18, 20] exploiting ...
María Auxilio Osorio Lama, David Pinto
FCS
2006
13 years 9 months ago
Polynomially Uncomputable Number-Theoretic Problems in Cryptography and Network Security
By far the most important automated tool for network and communications security is encryption, but encryption itself needs security. As we know, many cryptosystems and cryptograp...
Song Y. Yan, Glyn James, Gongyi Wu
FLAIRS
1998
13 years 9 months ago
Discovering Heuristic Strategy for Solving Scheduling Problems
Optimallysolving a scheduling problemis computationally intractable, hencevarieties of techniques and methodshave been explored to obtain sub-optimal solutions to such problems. I...
Rasiah Loganantharaj
IJCAI
1989
13 years 8 months ago
Preprocessing Search Spaces for Branch and Bound Search
Heuristic search procedures are useful in a large number of problems of practical importance. Such procedures operate by searching several paths in a search space at the same time...
Qiang Yang, Dana S. Nau
IJCNN
2006
IEEE
14 years 1 months ago
Improvement of an Artificial Neural Network Model using Min-Max Preprocessing for the Prediction of Wave-induced Seabed Liquefac
—In the past decade, artificial neural networks (ANNs) have been widely applied to the engineering problems with a complicated system. ANNs are becoming an important alternative ...
Deaho Cha, Michael Blumenstein, Hong Zhang, Dong-S...