Sciweavers

1041 search results - page 121 / 209
» Randomizing Reductions of Search Problems
Sort
View
IACR
2011
206views more  IACR 2011»
12 years 7 months ago
Shortest Lattice Vectors in the Presence of Gaps
Given a lattice L with the i-th successive minimum λi, its i-th gap λi λ1 often provides useful information for analyzing the security of cryptographic schemes related to L. The...
Mingjie Liu, Xiaoyun Wang, Guangwu Xu, Xuexin Zhen...
ISCIS
2003
Springer
14 years 1 months ago
A New Continuous Action-Set Learning Automaton for Function Optimization
In this paper, we study an adaptive random search method based on continuous action-set learning automaton for solving stochastic optimization problems in which only the noisecorr...
Hamid Beigy, Mohammad Reza Meybodi
GECCO
2006
Springer
145views Optimization» more  GECCO 2006»
13 years 11 months ago
Multi-objective genetic algorithms for pipe arrangement design
This paper presents an automatic design method for piping arrangement. A pipe arrangement design problem is proposed for a space in which many pipes and objects co-exist. This pro...
Satoshi Ikehira, Hajime Kimura
SECON
2007
IEEE
14 years 2 months ago
Approximation Algorithm for Base Station Placement in Wireless Sensor Networks
Base station location has significant impact on network lifetime performance for a sensor network. For a multihop sensor network, this problem is particular challenging as we need ...
Yi Shi, Yiwei Thomas Hou
SPIN
2004
Springer
14 years 1 months ago
Explicit State Model Checking with Hopper
The Murϕ-based Hopper tool is a general purpose explicit model checker. Hopper leverages Murϕ’s class structure to implement new algorithms. Hopper differs from Murϕ in that i...
Michael Jones, Eric Mercer