Sciweavers

4117 search results - page 109 / 824
» On the Satisfiability of Complex Constraints
Sort
View
DLOG
2004
15 years 7 months ago
Efficient Reasoning with Range and Domain Constraints
We show how a tableaux algorithm for SHIQ can be extended to support role boxes that include range and domain axioms, prove that the extended algorithm is still a decision procedur...
Dmitry Tsarkov, Ian Horrocks
PVLDB
2008
90views more  PVLDB 2008»
15 years 5 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
ICTAI
2009
IEEE
15 years 4 months ago
Constraint-Based Evolutionary QoS Adaptation for Power Utility Communication Networks
This paper studies an evolutionary multiobjective optimization algorithm, called EVOLT, which heuristically optimizes QoS (quality of service) in communication networks for electr...
Paskorn Champrasert, Junichi Suzuki, Tetsuo Otani
TOG
2002
98views more  TOG 2002»
15 years 6 months ago
Synthesis of complex dynamic character motion from simple animations
In this paper we present a general method for rapid prototyping of realistic character motion. We solve for the natural motion from a simple animation provided by the animator. Ou...
C. Karen Liu, Zoran Popovic
STACS
2010
Springer
16 years 1 months ago
The Complexity of Approximating Bounded-Degree Boolean #CSP
The degree of a CSP instance is the maximum number of times that a variable may appear in the scope of constraints. We consider the approximate counting problem for Boolean CSPs wi...
Martin E. Dyer, Leslie Ann Goldberg, Markus Jalsen...