Sciweavers

738 search results - page 90 / 148
» Crossover can provably be useful in evolutionary computation
Sort
View
CSL
2007
Springer
15 years 4 months ago
Unbounded Proof-Length Speed-Up in Deduction Modulo
In 1973, Parikh proved a speed-up theorem conjectured by G¨odel 37 years before: there exist arithmetical formulæ that are provable in first order arithmetic, but whose shorter ...
Guillaume Burel
COMPGEOM
1997
ACM
15 years 1 months ago
Realistic Input Models for Geometric Algorithms
Many algorithms developed in computational geometry are needlessly complicated and slow because they have to be prepared for very complicated, hypothetical inputs. To avoid this, ...
Mark de Berg, Matthew J. Katz, A. Frank van der St...
PVLDB
2010
97views more  PVLDB 2010»
14 years 8 months ago
Ranking Continuous Probabilistic Datasets
Ranking is a fundamental operation in data analysis and decision support, and plays an even more crucial role if the dataset being explored exhibits uncertainty. This has led to m...
Jian Li, Amol Deshpande
ICDE
2006
IEEE
156views Database» more  ICDE 2006»
15 years 11 months ago
Sovereign Joins
We present a secure network service for sovereign information sharing whose only trusted component is an off-theshelf secure coprocessor. The participating data providers send enc...
Rakesh Agrawal, Dmitri Asonov, Murat Kantarcioglu,...
INFORMATICALT
2007
76views more  INFORMATICALT 2007»
14 years 9 months ago
An Integrative Framework to Protocol Analysis and Repair: Bellare-Rogaway Model + Planning + Model Checker
A modified version of the Bellare and Rogaway (1993) adversarial model is encoded using Asynchronous Product Automata (APA). A model checker tool, Simple Homomorphism Verificatio...
Kim-Kwang Raymond Choo