Sciweavers

2976 search results - page 213 / 596
» On the bounded integer programming
Sort
View
ASIACRYPT
2008
Springer
15 years 8 months ago
Sufficient Conditions for Intractability over Black-Box Groups: Generic Lower Bounds for Generalized DL and DH Problems
Abstract. The generic (aka. black-box) group model is a valuable methodology for analyzing the computational hardness of number-theoretic problems used in cryptography. Since the p...
Andy Rupp, Gregor Leander, Endre Bangerter, Alexan...
MICRO
2010
IEEE
153views Hardware» more  MICRO 2010»
15 years 4 months ago
AVF Stressmark: Towards an Automated Methodology for Bounding the Worst-Case Vulnerability to Soft Errors
Soft error reliability is increasingly becoming a first-order design concern for microprocessors, as a result of higher transistor counts, shrinking device geometries and lowering ...
Arun A. Nair, Lizy Kurian John, Lieven Eeckhout
ICASSP
2009
IEEE
15 years 4 months ago
Robust joint localization and time synchronization in wireless sensor networks with bounded anchor uncertainties
A unified framework to jointly solve the two problems of localization and synchronization at the same time is presented in this paper. The joint approach is attractive because it ...
Jun Zheng, Yik-Chung Wu
CVPR
2008
IEEE
16 years 8 months ago
A polynomial-time bound for matching and registration with outliers
We present a framework for computing optimal transformations, aligning one point set to another, in the presence of outliers. Example applications include shape matching and regis...
Carl Olsson, Olof Enqvist, Fredrik Kahl
GECCO
2009
Springer
138views Optimization» more  GECCO 2009»
16 years 1 months ago
Analysis of micro-behavior and bounded rationality in double auction markets using co-evolutionary GP
We investigate the dynamics of trader behaviors using a co-evolutionary genetic programming system to simulate a double-auction market. The objective of this study is twofold. Fir...
Shu-Heng Chen, Ren-Jie Zeng, Tina Yu