Sciweavers

285 search results - page 35 / 57
» The complexity of soft constraint satisfaction
Sort
View
73
Voted
ECAI
2006
Springer
15 years 3 months ago
Distributed Log-Based Reconciliation
Computer Supported Cooperative Work (CSCW) defines software tools and technology to support groups of people working together on a project, often at different sites [5]. In this wo...
Yek Loong Chong, Youssef Hamadi
AAAI
1994
15 years 1 months ago
Small is Beautiful: A Brute-Force Approach to Learning First-Order Formulas
We describe a method for learning formulas in firstorder logic using a brute-force, smallest-first search. The method is exceedingly simple. It generates all irreducible well-form...
Steven Minton, Ian Underwood
CP
2011
Springer
13 years 11 months ago
Hierarchically Nested Convex VCSP
We introduce tractable classes of VCSP instances based on convex cost functions. Firstly, we show that the class of VCSP instances satisfying the hierarchically nested convexity pr...
Martin C. Cooper, Stanislav Zivny
SPIN
2005
Springer
15 years 5 months ago
Repairing Structurally Complex Data
We present a novel algorithm for repairing structurally complex data. Given an assertion that represents desired structural integrity constraints and a structure that violates them...
Sarfraz Khurshid, Iván García, Yuk L...
GLOBECOM
2008
IEEE
15 years 6 months ago
Optimal LLR Clipping Levels for Mixed Hard/Soft Output Detection
Abstract—Consider a communications system where the detector generates a mix of hard and soft outputs, which are then fed into a soft-input channel decoder. In such a setting, it...
Ernesto Zimmermann, David L. Milliner, John R. Bar...