Sciweavers

914 search results - page 34 / 183
» Analysis of Heuristic Synergies
Sort
View
INFOCOM
2003
IEEE
15 years 5 months ago
Computing the Types of the Relationships between Autonomous Systems
— We investigate the problem of computing the types of the relationships between Internet Autonomous Systems. We refer to the model introduced in [1], [2] that bases the discover...
Giuseppe Di Battista, Maurizio Patrignani, Maurizi...
ICGI
1998
Springer
15 years 4 months ago
A Stochastic Search Approach to Grammar Induction
This paper describes a new sampling-based heuristic for tree search named SAGE and presents an analysis of its performance on the problem of grammar induction. This last work has b...
Hugues Juillé, Jordan B. Pollack
EC
2007
167views ECommerce» more  EC 2007»
14 years 11 months ago
Comparison-Based Algorithms Are Robust and Randomized Algorithms Are Anytime
Randomized search heuristics (e.g., evolutionary algorithms, simulated annealing etc.) are very appealing to practitioners, they are easy to implement and usually provide good per...
Sylvain Gelly, Sylvie Ruette, Olivier Teytaud
ECLIPSE
2006
ACM
15 years 5 months ago
Generating run-time progress reports for a points-to analysis in Eclipse
Eclipse plug-ins have access to a rich collection of GUI components. One such component is the progress bar, which allows a long-running task to provide Eclipse users with feedbac...
Jason Sawin, Mariana Sharp, Atanas Rountev
CC
2012
Springer
227views System Software» more  CC 2012»
13 years 7 months ago
Programming Paradigm Driven Heap Analysis
The computational cost and precision of a shape style heap analysis is highly dependent on the way method calls are handled. This paper introduces a new approach to analyzing metho...
Mark Marron, Ondrej Lhoták, Anindya Banerje...