Sciweavers

13376 search results - page 231 / 2676
» Problem Solving with
Sort
View
160
Voted
ANTS
2006
Springer
139views Algorithms» more  ANTS 2006»
15 years 7 months ago
Hard Instances of the Constrained Discrete Logarithm Problem
The discrete logarithm problem (DLP) generalizes to the constrained DLP, where the secret exponent x belongs to a set known to the attacker. The complexity of generic algorithms f...
Ilya Mironov, Anton Mityagin, Kobbi Nissim
116
Voted
CIE
2007
Springer
15 years 9 months ago
Post's Problem for Ordinal Register Machines
We study Post’s Problem for the ordinal register machines defined in [6], showing that its general solution is positive, but that any set of ordinals solving it must be unbounde...
Joel David Hamkins, Russell G. Miller
132
Voted
CEC
2009
IEEE
15 years 10 months ago
Constructing test problems for bilevel evolutionary multi-objective optimization
— Many real-world problems demand a feasible solution to satisfy physical equilibrium, stability, or certain properties which require an additional lower level optimization probl...
Kalyanmoy Deb, Ankur Sinha
143
Voted
GECCO
2010
Springer
168views Optimization» more  GECCO 2010»
15 years 7 months ago
Elementary landscapes of frequency assignment problems
We analyze various forms of the Frequency Assignment Problem using the theory of elementary landscapes. We show that three variants of the Frequency Assignment Problem are either ...
L. Darrell Whitley, J. Francisco Chicano, Enrique ...
127
Voted
JSW
2006
76views more  JSW 2006»
15 years 3 months ago
Variable Neighbourhood Search for Job Shop Scheduling Problems
Variable Neighbourhood Search (VNS) is one of the most recent metaheuristics used for problem solving in which a systematic change of neighbourhood within a local search is carried...
Mehmet Sevkli, Mehmet Emin Aydin