Sciweavers

4036 search results - page 619 / 808
» Formal Methods
Sort
View
CSC
2006
15 years 8 months ago
B-Splines for Genomic Signatures
- A variety of data analysis concerned with genome sequences support the proposal that each living organism owns a genomic signature. Classical approaches to the genomic signature ...
Gennaro Iaccarino, Filomena de Santis
ICWS
2004
IEEE
15 years 7 months ago
Logic-based Web Services Composition: From Service Description to Process Model
This paper introduces a method for automatic composition of Semantic Web services using Linear Logic (LL) theorem proving. The method uses Semantic Web service language (DAML-S) f...
Jinghai Rao, Peep Küngas, Mihhail Matskin
DAGSTUHL
2003
15 years 7 months ago
Genetic Design: Amplifying Our Ability to Deal With Requirements Complexity
Individual functional requirements represent fragments of behavior, while a design that satisfies a set of functional requirements represents integrated behavior. This perspective ...
R. Geoff Dromey
FLAIRS
2003
15 years 7 months ago
Incremental Breakout Algorithm with Variable Ordering
This paper presents the Incremental Breakout Algorithm with Variable Ordering (IncBA). This algorithm belongs to the class of local search algorithms for solving Constraint Satisf...
Carlos Eisenberg, Boi Faltings
SODA
2000
ACM
114views Algorithms» more  SODA 2000»
15 years 7 months ago
Typical random 3-SAT formulae and the satisfiability threshold
: k-SAT is one of the best known among a wide class of random constraint satisfaction problems believed to exhibit a threshold phenomenon where the control parameter is the ratio, ...
Olivier Dubois, Yacine Boufkhad, Jacques Mandler