Sciweavers

14518 search results - page 5 / 2904
» Two Problems for Sophistication
Sort
View
AINA
2003
IEEE
13 years 11 months ago
Signature Schemes Based on Two Hard Problems Simultaneously
In 1994, Harn proposed a signature scheme based on the modified ElGamal's scheme and claimed that the security relies on both of the factorization and the discrete logarithm....
Ching-Te Wang, Chu-Hsing Lin, Chin-Chen Chang
ORL
2007
86views more  ORL 2007»
13 years 7 months ago
Complexity of two dual criteria scheduling problems
In this article we answer the complexity question of two dual criteria scheduling problems which had been open for a long time. Both problems are single machine scheduling problem...
Yumei Huo, Joseph Y.-T. Leung, Hairong Zhao
GECCO
2007
Springer
159views Optimization» more  GECCO 2007»
14 years 1 months ago
Two adaptive mutation operators for optima tracking in dynamic optimization problems with evolution strategies
The dynamic optimization problem concerns finding an optimum in a changing environment. In the tracking problem, the optimizer should be able to follow the optimum’s changes ov...
Claudio Rossi, Antonio Barrientos, Jaime del Cerro
ICALP
2007
Springer
14 years 1 months ago
Commitment Under Uncertainty: Two-Stage Stochastic Matching Problems
Abstract. We define and study two versions of the bipartite matching problem in the framework of two-stage stochastic optimization with recourse. In one version the uncertainty is...
Irit Katriel, Claire Kenyon-Mathieu, Eli Upfal
EOR
2008
140views more  EOR 2008»
13 years 7 months ago
Combining two pheromone structures for solving the car sequencing problem with Ant Colony Optimization
The car sequencing problem involves scheduling cars along an assembly line while satisfying capacity constraints. In this paper, we describe an Ant Colony Optimization (ACO) algor...
Christine Solnon