Sciweavers

1300 search results - page 70 / 260
» Constraint satisfaction problems and global cardinality cons...
Sort
View
76
Voted
CDB
2004
Springer
143views Database» more  CDB 2004»
15 years 3 months ago
Constraint Processing Techniques for Improving Join Computation: A Proof of Concept
Constraint Processing and Database techniques overlap significantly. We discuss here the application of a constraint satisfaction technique, called dynamic bundling, to databases....
Anagh Lal, Berthe Y. Choueiry
WWW
2008
ACM
15 years 11 months ago
Integrating the IAC neural network in ontology mapping
Ontology mapping seeks to find semantic correspondences between similar elements of different ontologies. This paper proposes a neural network based approach to search for a globa...
Ming Mao, Yefei Peng, Michael Spring
ISAAC
2003
Springer
210views Algorithms» more  ISAAC 2003»
15 years 3 months ago
The Student-Project Allocation Problem
We study the problem of allocating students to projects, where both students and lecturers have preferences over projects, and both projects and lecturers have capacities. In this...
David J. Abraham, Robert W. Irving, David Manlove
86
Voted
IJCAI
2003
14 years 11 months ago
Describing and Utilizing Constraints to Answer Queries in Data-Integration Systems
In data-integration systems, information sources often have various constraints such as “all houses stored at a source have a unique address.” These constraints are very usefu...
Chen Li
70
Voted
ECAIW
2000
Springer
15 years 2 months ago
Solving the Sports League Scheduling Problem with Tabu Search
In this paper we present a tabu approach for a version of the Sports League Scheduling Problem. The approach adopted is based on a formulation of the problem as a Constraint Satisf...
Jean-Philippe Hamiez, Jin-Kao Hao