Sciweavers

5606 search results - page 253 / 1122
» Randomization Techniques for Graphs.
Sort
View
ECAI
2008
Springer
15 years 8 months ago
A Decomposition Technique for Max-CSP
The objective of the Maximal Constraint Satisfaction Problem (Max-CSP) is to find an instantiation which minimizes the number of constraint violations in a constraint network. In t...
Hachemi Bennaceur, Christophe Lecoutre, Olivier Ro...
KRDB
2003
111views Database» more  KRDB 2003»
15 years 7 months ago
A Framework for Answering Queries using Multiple Representation and Inference Techniques
The Polylog framework is designed to provide a language for efficiently automating complex queries of information represented in multiple formats. A Polylog program contains a set...
Nicholas L. Cassimatis
COMAD
2009
15 years 7 months ago
Vector-based Ranking Techniques for Identifying the Topical Anchors of a Context
Terms in textual documents tend to occur more in contexts to which they are related. We can exploit this bias by modelling terms and their cooccurrences s, resembling the abstract...
Aditya Ramana Rachakonda, Srinath Srinivasa
ICSE
2007
IEEE-ACM
16 years 6 months ago
Randomized Differential Testing as a Prelude to Formal Verification
Most flight software testing at the Jet Propulsion Laboratory relies on the use of hand-produced test scenarios and is executed on systems as similar as possible to actual mission...
Alex Groce, Gerard J. Holzmann, Rajeev Joshi
CSFW
2010
IEEE
15 years 10 months ago
On Protection by Layout Randomization
Abstract—Layout randomization is a powerful, popular technique for software protection. We present it and study it in programming-language terms. More specifically, we consider ...
Martín Abadi, Gordon D. Plotkin