Sciweavers

106 search results - page 13 / 22
» Heavy-Tailed Phenomena in Satisfiability and Constraint Sati...
Sort
View
CPAIOR
2006
Springer
13 years 9 months ago
Conflict-Directed A* Search for Soft Constraints
As many real-world problems involve user preferences, costs, or probabilities, constraint satisfaction has been extended to optimization by generalizing hard constraints to soft co...
Martin Sachenbacher, Brian C. Williams
SARA
2009
Springer
14 years 1 months ago
Integrating Constraint Models for Sequential and Partial-Order Planning
Classical planning deals with finding a (shortest) sequence of actions transferring the world from its initial state to a state satisfying the goal condition. Traditional planning...
Roman Barták, Daniel Toropila
FLAIRS
2008
13 years 9 months ago
Conditional and Composite Constraints with Preferences
Preferences in constraint problems are common but significant in many real world applications. In this paper, we extend our conditional and composite CSP (CCCSP) framework, managi...
Malek Mouhoub, Amrudee Sukpan
PVLDB
2008
90views more  PVLDB 2008»
13 years 6 months ago
Generating XML structure using examples and constraints
This paper presents a framework for automatically generating structural XML documents. The user provides a target DTD and an example of an XML document, called a Generate-XML-ByEx...
Sara Cohen
STOC
2006
ACM
132views Algorithms» more  STOC 2006»
14 years 7 months ago
Near-optimal algorithms for unique games
Unique games are constraint satisfaction problems that can be viewed as a generalization of Max-Cut to a larger domain size. The Unique Games Conjecture states that it is hard to ...
Moses Charikar, Konstantin Makarychev, Yury Makary...