Sciweavers

8512 search results - page 1404 / 1703
» Computing Theory With Relevance
Sort
View
ECSQARU
2007
Springer
16 years 26 days ago
Forward-Backward-Viterbi Procedures in the Transferable Belief Model for State Sequence Analysis Using Belief Functions
Abstract. The Transferable Belief Model (TBM) relies on belief functions and enables one to represent and combine a variety of knowledge from certain up to ignorance as well as con...
Emmanuel Ramasso, Michèle Rombaut, Denis Pe...
ESORICS
2007
Springer
16 years 26 days ago
Modular Access Control Via Strategic Rewriting
Abstract. Security policies, in particular access control, are fundamental elements of computer security. We address the problem of authoring and analyzing policies in a modular wa...
Daniel J. Dougherty, Claude Kirchner, Hél&e...
FCT
2007
Springer
16 years 26 days ago
Rewriting Systems with Data
Abstract. We introduce a uniform framework for reasoning about infinitestate systems with unbounded control structures and unbounded data domains. Our framework is based on constr...
Ahmed Bouajjani, Peter Habermehl, Yan Jurski, Miha...
FOSSACS
2007
Springer
16 years 26 days ago
Approximating a Behavioural Pseudometric Without Discount for Probabilistic Systems
Desharnais, Gupta, Jagadeesan and Panangaden introduced a family of behavioural pseudometrics for probabilistic transition systems. These pseudometrics are a quantitative analogue ...
Franck van Breugel, Babita Sharma, James Worrell
175
Voted
GECCO
2007
Springer
190views Optimization» more  GECCO 2007»
16 years 26 days ago
Analysis of evolutionary algorithms for the longest common subsequence problem
In the longest common subsequence problem the task is to find the longest sequence of letters that can be found as subsequence in all members of a given finite set of sequences....
Thomas Jansen, Dennis Weyland
« Prev « First page 1404 / 1703 Last » Next »