Sciweavers

1898 search results - page 82 / 380
» Weak Keys for IDEA
Sort
View
ACTA
2006
108views more  ACTA 2006»
13 years 8 months ago
Refinement verification of the lazy caching algorithm
The lazy caching algorithm of Afek, Brown, and Merrit (1993) is a protocol that allows the use of local caches with delayed updates. It results in a memory model that is not atomi...
Wim H. Hesselink
DAM
2006
88views more  DAM 2006»
13 years 8 months ago
NP-completeness results for edge modification problems
The aim of edge modification problems is to change the edge set of a given graph as little as possible in order to satisfy a certain property. Edge modification problems in graphs...
Pablo Burzyn, Flavia Bonomo, Guillermo Durá...
IPL
2008
118views more  IPL 2008»
13 years 8 months ago
Slicing for modern program structures: a theory for eliminating irrelevant loops
Slicing is a program transformation technique with numerous applications, as it allows the user to focus on the parts of a program that are relevant for a given purpose. Ideally, ...
Torben Amtoft
INFORMATICALT
2006
96views more  INFORMATICALT 2006»
13 years 8 months ago
A Note about Total Stability of a Class of Hybrid Systems
Abstract. Robust stability results for nominally linear hybrid systems are obtained from total stability theorems for purely continuous-time and discrete-time systems. The class of...
Manuel de la Sen
PR
2006
101views more  PR 2006»
13 years 8 months ago
Feature-based approach to semi-supervised similarity learning
For the management of digital document collections, automatic database analysis still has ties to deal with semantic queries and abstract concepts that users are looking for. When...
Philippe Henri Gosselin, Matthieu Cord