Sciweavers

4797 search results - page 154 / 960
» The complexity of partition tasks
Sort
View
FM
2009
Springer
124views Formal Methods» more  FM 2009»
16 years 28 days ago
An Incremental Approach to Scope-Bounded Checking Using a Lightweight Formal Method
We present a novel approach to optimize scope-bounded checking programs using a relational constraint solver. Given a program and its correctness specification, the traditional app...
Danhua Shao, Sarfraz Khurshid, Dewayne E. Perry
BCB
2010
161views Bioinformatics» more  BCB 2010»
15 years 1 months ago
Genome-wide compatible SNP intervals and their properties
Recent studies suggest that the mammalian genomes can be subdivided in segments within which there is limited haplotype diversity. Understanding the distribution and structure of ...
Jeremy W. Wang, Kyle J. Moore, Qi Zhang, Fernando ...
CAISE
2007
Springer
16 years 16 days ago
A Context-based Approach for Complex Semantic Matching
Semantic matching1 is a fundamental step in implementing data sharing applications. Most systems automating this task however limit themselves to finding simple (one-to-one) match...
Youssef Bououlid Idrissi, Julie Vachon
ATAL
2004
Springer
15 years 11 months ago
On the Communication Complexity of Multilateral Trading
We study the complexity of a multilateral negotiation framework where autonomous agents agree on a sequence of deals to exchange sets of discrete resources in order to both furthe...
Ulrich Endriss, Nicolas Maudet
KCAP
2003
ACM
15 years 11 months ago
FONTE: factorizing ONTology engineering complexity
Because it is difficult to engineer a complex ontology with time, we here consider a method that allows for factorizing the complexity of the engineering process, FONTE (Factoriz...
Jorge Santos, Steffen Staab