Sciweavers

536 search results - page 39 / 108
» A Translational Approach to Constraint Answer Set Solving
Sort
View
127
Voted
EOR
2007
174views more  EOR 2007»
15 years 4 months ago
A Benders approach for the constrained minimum break problem
This paper presents a hybrid IP/CP algorithm for designing a double round robin schedule with a minimal number of breaks. Both mirrored and non-mirrored schedules with and without ...
Rasmus V. Rasmussen, Michael A. Trick
ACISICIS
2007
IEEE
15 years 10 months ago
A Hybrid Simulated Annealing with Kempe Chain Neighborhood for the University Timetabling Problem
This paper addresses the problem of finding a feasible solution for the University Course Timetabling Problem (UCTP), i.e. a solution that satisfies all the so-called hard const...
Mauritsius Tuga, Regina Berretta, Alexandre Mendes
MMSP
2008
IEEE
245views Multimedia» more  MMSP 2008»
15 years 10 months ago
A convex programming approach for color stereo matching
—This paper addresses the problem of dense disparity estimation from a pair of color stereo images. Based on a convex set theoretic formulation, the stereo matching problem is ca...
Wided Miled, Béatrice Pesquet-Popescu, Jean...
SIGMOD
2007
ACM
157views Database» more  SIGMOD 2007»
16 years 4 months ago
Compiling mappings to bridge applications and databases
Translating data and data access operations between applications and databases is a longstanding data management problem. We present a novel approach to this problem, in which the...
Sergey Melnik, Atul Adya, Philip A. Bernstein
EDBT
2008
ACM
137views Database» more  EDBT 2008»
16 years 4 months ago
Synthesizing structured text from logical database subsets
In the classical database world, information access has been based on a paradigm that involves structured, schema-aware, queries and tabular answers. In the current environment, h...
Alkis Simitsis, Georgia Koutrika, Yannis Alexandra...