Sciweavers

7139 search results - page 1196 / 1428
» Language Engineering in Practice
Sort
View
ICNP
2005
IEEE
15 years 10 months ago
Typed Abstraction of Complex Network Compositions
straction of Complex Network Compositions∗ Azer Bestavros, Adam D. Bradley, Assaf J. Kfoury, and Ibrahim Matta Department of Computer Science Boston University The heterogeneity...
Azer Bestavros, Adam Bradley, Assaf J. Kfoury, Ibr...
CP
2005
Springer
15 years 10 months ago
Using SAT in QBF
QBF is the problem of deciding the satisfiability of quantified boolean formulae in which variables can be either universally or existentially quantified. QBF generalizes SAT (S...
Horst Samulowitz, Fahiem Bacchus
GPCE
2005
Springer
15 years 10 months ago
Object-Oriented Reengineering Patterns - An Overview
Successful software systems must be prepared to evolve or they will die. Although object-oriented software systems are built to last, over time they degrade as much as any legacy s...
Oscar Nierstrasz, Stéphane Ducasse, Serge D...
ICALP
2005
Springer
15 years 10 months ago
Optimal Spaced Seeds for Faster Approximate String Matching
Filtering is a standard technique for fast approximate string matching in practice. In filtering, a quick first step is used to rule out almost all positions of a text as possib...
Martin Farach-Colton, Gad M. Landau, Süleyman...
ICALP
2005
Springer
15 years 10 months ago
Completely Non-malleable Schemes
Abstract An encryption scheme is non-malleable if the adversary cannot transform a ciphertext into one of a related message under the given public key. Although providing a very st...
Marc Fischlin
« Prev « First page 1196 / 1428 Last » Next »