Sciweavers

3495 search results - page 257 / 699
» On the random satisfiable process
Sort
View
JAR
2008
81views more  JAR 2008»
15 years 7 months ago
Algorithms for Computing Minimal Unsatisfiable Subsets of Constraints
Much research in the area of constraint processing has recently been focused on extracting small unsatisfiable "cores" from unsatisfiable constraint systems with the goal...
Mark H. Liffiton, Karem A. Sakallah
LISP
2008
97views more  LISP 2008»
15 years 7 months ago
Efficient and flexible access control via Jones-optimal logic program specialisation
We describe the use of a flexible meta-interpreter for performing access control checks on deductive databases. The meta-program is implemented in Prolog and takes as input a datab...
Steve Barker, Michael Leuschel, Mauricio Varea
CORR
2010
Springer
95views Education» more  CORR 2010»
15 years 6 months ago
M-Banking Security - a futuristic improved security approach
In last few decades large technology development raised various new needs. Financial sector has also no exception. People are approaching all over the world to fulfill there dream...
Geeta S. Navale, Swati S. Joshi, Aaradhana A. Desh...
ICST
2010
IEEE
15 years 5 months ago
Automated and Scalable T-wise Test Case Generation Strategies for Software Product Lines
Abstract—Software Product Lines (SPL) are difficult to validate due to combinatorics induced by variability across their features. This leads to combinatorial explosion of the n...
Gilles Perrouin, Sagar Sen, Jacques Klein, Benoit ...
ENASE
2009
131views Hardware» more  ENASE 2009»
15 years 5 months ago
Flexible Composites and Automatic Component Selection for Service-Based Applications
In traditional Software Engineering approaches, an application is described as a composite entity containing all its components. This approach is no longer relevant in modern Softw...
Jacky Estublier, Idrissa A. Dieng, Eric Simon, Ger...