Sciweavers

7991 search results - page 133 / 1599
» Using More Reasoning to Improve
Sort
View
CRYPTO
2011
Springer
191views Cryptology» more  CRYPTO 2011»
14 years 5 months ago
Analyzing Blockwise Lattice Algorithms Using Dynamical Systems
Strong lattice reduction is the key element for most attacks against lattice-based cryptosystems. Between the strongest but impractical HKZ reduction and the weak but fast LLL redu...
Guillaume Hanrot, Xavier Pujol, Damien Stehl&eacut...
JWSR
2008
98views more  JWSR 2008»
15 years 6 months ago
Mining and Improving Composite Web Services Recovery Mechanisms
: Ensuring composite services reliability is a challenging problem. Indeed, due to the inherent autonomy and heterogeneity of Web services it is difficult to predict and reason abo...
Sami Bhiri, Walid Gaaloul, Claude Godart
EOR
2007
75views more  EOR 2007»
15 years 6 months ago
Improved modeling and solution methods for the multi-resource routing problem
This paper presents modeling and solution method improvements for the Multi-Resource Routing Problem (MRRP) with flexible tasks. The MRRP with flexible tasks is used to model ro...
Peter Francis, Guangming Zhang, Karen R. Smilowitz
FTCS
1998
144views more  FTCS 1998»
15 years 7 months ago
Improving Software Robustness with Dependability Cases
Programs fail mainly for two reasons: logic errors in the code, and exception failures. Exception failures can account for up to 2/3 of system crashes [6], hence are worthy of ser...
Roy A. Maxion, Robert T. Olszewski
GIS
2005
ACM
16 years 7 months ago
Improving the R*-tree with outlier handling techniques
The R*-tree, as a state-of-the-art spatial index, has already found its way into commercial systems like Oracle. In this paper, we aim at improving query performance of the R*tree...
Tian Xia, Donghui Zhang