Sciweavers

890 search results - page 166 / 178
» Programming language methods in computer security
Sort
View
CP
2007
Springer
14 years 2 months ago
Hierarchical Hardness Models for SAT
Abstract. Empirical hardness models are a recent approach for studying NP-hard problems. They predict the runtime of an instance using efficiently computable features. Previous res...
Lin Xu, Holger H. Hoos, Kevin Leyton-Brown
MIDDLEWARE
2007
Springer
14 years 2 months ago
Rule-based reasoning about qualitative spatiotemporal relations
This paper is about a novel rule-based approach for reasoning about qualitative spatiotemporal relations among technology-rich autonomous objects, to which we refer to as artifact...
Clemens Holzmann
ACMSE
2006
ACM
14 years 2 months ago
Automatic support for testing web-based enterprise applications
In this paper we consider the problem of automatically generating test suites associated with web-based enterprise systems. In particular, we discuss the construction of a tool de...
Arturo Sanchez, Brandon Vega, Alexander Gonzalez, ...
CP
2005
Springer
14 years 2 months ago
Mind the Gaps: A New Splitting Strategy for Consistency Techniques
Classical methods for solving numerical CSPs are based on a branch and prune algorithm, a dichotomic enumeration process interleaved with a consistency filtering algorithm. In man...
Heikel Batnini, Claude Michel, Michel Rueher
TAPSOFT
1997
Springer
14 years 18 days ago
Specifying Complex and Structured Systems with Evolving Algebras
This paper presents an approach for specifying complex, structured systems with Evolving Algebras by means of aggregation and composition. Evolving algebras provide a formal method...
Wolfgang May