Sciweavers

82 search results - page 12 / 17
» Reasoning about online algorithms with weighted automata
Sort
View
KBSE
2010
IEEE
15 years 9 days ago
Solving string constraints lazily
Decision procedures have long been a fixture in program analysis, and reasoning about string constraints is a key element in many program analyses and testing frameworks. Recent ...
Pieter Hooimeijer, Westley Weimer
94
Voted
ICSE
2000
IEEE-ACM
15 years 5 months ago
An inheritance-based technique for building simulation proofs incrementally
This paper presents a technique for incrementally constructing safety specifications, abstract algorithm descriptions, and simulation proofs showing that algorithms meet their spe...
Idit Keidar, Roger Khazan, Nancy A. Lynch, Alexand...
RECOMB
2005
Springer
16 years 2 months ago
Learning Interpretable SVMs for Biological Sequence Classification
Background: Support Vector Machines (SVMs) ? using a variety of string kernels ? have been successfully applied to biological sequence classification problems. While SVMs achieve ...
Christin Schäfer, Gunnar Rätsch, Sö...
EMSOFT
2006
Springer
15 years 5 months ago
Analysis of the zeroconf protocol using UPPAAL
We report on a case study in which the model checker Uppaal is used to formally model parts of Zeroconf, a protocol for dynamic configuration of IPv4 link-local addresses that has...
Biniam Gebremichael, Frits W. Vaandrager, Miaomiao...
61
Voted
PKDD
2005
Springer
85views Data Mining» more  PKDD 2005»
15 years 7 months ago
Improving Generalization by Data Categorization
In most of the learning algorithms, examples in the training set are treated equally. Some examples, however, carry more reliable or critical information about the target than the ...
Ling Li, Amrit Pratap, Hsuan-Tien Lin, Yaser S. Ab...