Sciweavers

1262 search results - page 36 / 253
» Diagnosis Problem Solving Using Fuzzy Relations
Sort
View
CP
2010
Springer
13 years 9 months ago
Towards Parallel Non Serial Dynamic Programming for Solving Hard Weighted CSP
We introduce a parallelized version of tree-decomposition based dynamic programming for solving difficult weighted CSP instances on many cores. A tree decomposition organizes cost ...
David Allouche, Simon de Givry, Thomas Schiex
SPIRE
2010
Springer
13 years 9 months ago
Why Large Closest String Instances Are Easy to Solve in Practice
We initiate the study of the smoothed complexity of the Closest String problem by proposing a semi-random model of Hamming distance. We restrict interest to the optimization versio...
Christina Boucher, Kathleen Wilkie
CP
2007
Springer
14 years 5 months ago
Structural Relaxations by Variable Renaming and Their Compilation for Solving MinCostSAT
Searching for optimal solutions to a problem using lower bounds obtained from a relaxation is a common idea in Heuristic Search and Planning. In SAT and CSPs, however, explicit rel...
Miquel Ramírez, Hector Geffner
BNCOD
2004
397views Database» more  BNCOD 2004»
14 years 11 days ago
DbSurfer: A Search and Navigation Tool for Relational Databases
Abstract. We present a new application for keyword search within relational databases, which uses a novel algorithm to solve the join discovery problem by finding Memex-like trails...
Richard Wheeldon, Mark Levene, Kevin Keenoy
ICOODB
2010
129views Database» more  ICOODB 2010»
13 years 9 months ago
Solving ORM by MAGIC: MApping GeneratIon and Composition
Object-relational mapping (ORM) technologies have been proposed as a solution for the impedance mismatch problem between object-oriented applications and relational databases. Exis...
David Kensche, Christoph Quix, Xiang Li 0002, Sand...