Sciweavers

2006 search results - page 325 / 402
» Heuristic Security-Testing Methods
Sort
View
WEA
2010
Springer
250views Algorithms» more  WEA 2010»
14 years 2 months ago
Randomized Rounding for Routing and Covering Problems: Experiments and Improvements
We investigate how the recently developed different approaches to generate randomized roundings satisfying disjoint cardinality constraints behave when used in two classical algori...
Benjamin Doerr, Marvin Künnemann, Magnus Wahl...
TIME
2002
IEEE
14 years 2 months ago
Applying Local Search to Temporal Reasoning
Local search techniques have attracted considerable interest in the Artificial Intelligence (AI) community since the development of GSAT [9] and the min-conflicts heuristic [5] ...
John Thornton, Matthew Beaumont, Abdul Sattar, Mic...
GECCO
2009
Springer
103views Optimization» more  GECCO 2009»
14 years 1 months ago
Using performance fronts for parameter setting of stochastic metaheuristics
In this work, we explore the idea that parameter setting of stochastic metaheuristics should be considered as a multiobjective problem. The so-called “performance fronts” pres...
Johann Dréo
MICCAI
2009
Springer
14 years 1 months ago
Bayesian Maximal Paths for Coronary Artery Segmentation from 3D CT Angiograms
We propose a recursive Bayesian model for the delineation of coronary arteries from 3D CT angiograms (cardiac CTA) and discuss the use of discrete minimal path techniques as an e...
David Lesage, Elsa D. Angelini, Isabelle Bloch, Ga...
CALC
2001
Springer
171views Cryptology» more  CALC 2001»
14 years 1 months ago
Approximate Integer Common Divisors
We show that recent results of Coppersmith, Boneh, Durfee and Howgrave-Graham actually apply in the more general setting of (partially) approximate common divisors. This leads us t...
Nick Howgrave-Graham