Sciweavers

Share
314 search results - page 1 / 63
» Formulation Schema Matching Problem for Combinatorial Optimi...
Sort
View
IBIS
2006
109views more  IBIS 2006»
11 years 5 months ago
Formulation Schema Matching Problem for Combinatorial Optimization Problem
: Schema matching is the task of finding semantic correspondences between elements of two schemas, which plays a key role in many database applications. In this paper, we cast the ...
Zhi Zhang, Pengfei Shi, Haoyang Che, Yong Sun, Jun...
BIS
2008
119views Business» more  BIS 2008»
11 years 6 months ago
Fuzzy Constraint-based Schema Matching Formulation
The deep Web has many challenges to be solved. Among them is schema matching. In this paper, we build a conceptual connection between the schema matching problem SMP and the fuzzy ...
Alsayed Algergawy, Eike Schallehn, Gunter Saake
DEXA
2005
Springer
109views Database» more  DEXA 2005»
11 years 10 months ago
Formalizing the XML Schema Matching Problem as a Constraint Optimization Problem
The first step in finding an efficient way to solve any difficult problem is making a complete, possibly formal, problem specification. This paper introduces a formal specifica...
Marko Smiljanic, Maurice van Keulen, Willem Jonker
4OR
2010
137views more  4OR 2010»
11 years 5 months ago
Extended formulations in combinatorial optimization
This survey is concerned with the size of perfect formulations for combinatorial optimization problems. By "perfect formulation", we mean a system of linear inequalities...
Michele Conforti, Gérard Cornuéjols,...
CP
2000
Springer
11 years 9 months ago
Linear Formulation of Constraint Programming Models and Hybrid Solvers
Constraint programming offers a variety of modeling objects such as logical and global constraints, that lead to concise and clear models for expressing combinatorial optimization...
Philippe Refalo
books