Sciweavers

14649 search results - page 45 / 2930
» Principles of problem solving
Sort
View
COR
2006
62views more  COR 2006»
13 years 10 months ago
Solving the Multidimensional Multiple-choice Knapsack Problem by constructing convex hulls
This paper presents a heuristic to solve the Multidimensional Multiple-choice Knapsack Problem (MMKP), a variant of the classical 0
Md. Mostofa Akbar, Mohammad Sohel Rahman, Mohammad...
TNN
2008
108views more  TNN 2008»
13 years 9 months ago
A Novel Recurrent Neural Network for Solving Nonlinear Optimization Problems With Inequality Constraints
This paper presents a novel recurrent neural network for solving nonlinear optimization problems with inequality constraints. Under the condition that the Hessian matrix of the ass...
Youshen Xia, Gang Feng, Jun Wang
CCE
2004
13 years 9 months ago
Solving distillation problems by terrain methods
This paper clearly shows that the recently proposed terrain methodology of Lucia and Yang (2003) can be used to solve steady-state distillation problems in a reliable and efficien...
Angelo Lucia, Feng Yang
ORL
2007
102views more  ORL 2007»
13 years 9 months ago
Using critical sets to solve the maximum independent set problem
A method that utilizes the polynomially solvable critical independent set problem for solving the maximum independent set problem on graphs with a nonempty critical independent se...
Sergiy Butenko, Svyatoslav Trukhanov
PKC
2010
Springer
199views Cryptology» more  PKC 2010»
13 years 8 months ago
Using Equivalence Classes to Accelerate Solving the Discrete Logarithm Problem in a Short Interval
The Pollard kangaroo method solves the discrete logarithm problem (DLP) in an interval of size N with heuristic average case expected running time approximately 2 √ N group opera...
Steven D. Galbraith, Raminder S. Ruprai