Sciweavers

3318 search results - page 101 / 664
» The Weak Instance Model
Sort
View
JAIR
2008
103views more  JAIR 2008»
13 years 8 months ago
SATzilla: Portfolio-based Algorithm Selection for SAT
It has been widely observed that there is no single "dominant" SAT solver; instead, different solvers perform best on different instances. Rather than following the trad...
Lin Xu, Frank Hutter, Holger H. Hoos, Kevin Leyton...
BCBGC
2008
13 years 9 months ago
BMA - Boolean Matrices as Model for Motif Kernels
We introduce the data model BM, which specifies kernels of motifs by means of Boolean matrices. Different from position frequency matrices these only specify which bases can appea...
Jan Schröder, Manfred Schimmler, Heiko Schr&o...
CAISE
2003
Springer
14 years 1 months ago
Ontology Mapping through Analysis of Model Extension
The overall problem addressed in this paper is to improve semantic interoperability in heterogeneous systems. Normally, the semantics of data is carried by ontology (concept model)...
Xiaomeng Su, Terje Brasethvik, Sari Hakkarainen
QSIC
2005
IEEE
14 years 1 months ago
Fault-Based Testing of Database Application Programs with Conceptual Data Model
Database application programs typically contain program units that use SQL statements to manipulate records in database instances. Testing the correctness of data manipulation by ...
W. K. Chan, S. C. Cheung, T. H. Tse
COR
2011
13 years 3 months ago
Event-based MILP models for resource-constrained project scheduling problems
In this paper we make a comparative study of several mixed integer linear programming (MILP) formulations for resource-constrained project scheduling problems (RCPSPs). First, we ...
Oumar Koné, Christian Artigues, Pierre Lope...