Sciweavers

523 search results - page 81 / 105
» Decidability of string graphs
Sort
View
PODC
2010
ACM
15 years 7 months ago
Brief announcement: on enhancing concurrency in distributed transactional memory
Distributed transactional memory (TM) models based on globally-consistent contention management policies may abort many transactions that could potentially commit without violatin...
Bo Zhang, Binoy Ravindran
FORMATS
2006
Springer
15 years 7 months ago
Symbolic Robustness Analysis of Timed Automata
We propose a symbolic algorithm for the analysis of the robustness of timed automata, that is the correctness of the model in presence of small drifts on the clocks or imprecision ...
Conrado Daws, Piotr Kordy
FLAIRS
2007
15 years 5 months ago
Interpretive Reasoning with Hypothetical Cases
Reasoning with hypothetical cases helps decision-makers evaluate alternate hypotheses for deciding a case. The hypotheticals demonstrate the sensitivity of a hypothesis to apparen...
Kevin D. Ashley
127
Voted
ACL
1993
15 years 4 months ago
A Complete and Recursive Feature Theory
Various feature descriptions are being employed in constrained-based grammar formalisms. The common notational primitive of these descriptions are functional attributes called fea...
Rolf Backofen, Gert Smolka
CLEIEJ
2008
72views more  CLEIEJ 2008»
15 years 3 months ago
Measuring Contribution of HTML Features in Web Document Clustering
Documents in HTML format have many features to analyze, from the terms in special sections to the phrases that appear in the whole document. However, it is important to decide whi...
Esteban Meneses, Oldemar Rodríguez-Rojas