Sciweavers

58 search results - page 4 / 12
» Constrainedness and Redundancy by Constraint Ordering
Sort
View
IJCAI
1997
13 years 9 months ago
Equational Reasoning using AC Constraints
Unfailing completion is a commonly used technique for equational reasoning. For equational problems with associative and commutative functions, unfailing completion often generate...
David A. Plaisted, Yunshan Zhu
ADC
2005
Springer
124views Database» more  ADC 2005»
14 years 1 months ago
Removing XML Data Redundancies Using Functional and Equality-Generating Dependencies
We study the design issues of data-centric XML documents where (1) there are no mixed contents, i.e., each element may have some subelements and attributes, or it may have a singl...
Junhu Wang, Rodney W. Topor
ISORC
2005
IEEE
14 years 1 months ago
Building Responsive TMR-Based Servers in Presence of Timing Constraints
This paper is on the construction of a fault-tolerant and responsive server subsystem in an application context where the subsystem is accessed through an asynchronous network by ...
Paul D. Ezhilchelvan, Jean-Michel Hélary, M...
DIAGRAMS
2010
Springer
13 years 8 months ago
Fragments of Spider Diagrams of Order and Their Relative Expressiveness
Abstract. Investigating the expressiveness of a diagrammatic logic provides insight into how its syntactic elements interact at the semantic level. Moreover, it allows for comparis...
Aidan Delaney, Gem Stapleton, John Taylor, Simon J...
AAAI
1996
13 years 9 months ago
A Complexity Analysis of Space-Bounded Learning Algorithms for the Constraint Satisfaction Problem
Learning during backtrack search is a space-intensive process that records information (such as additional constraints) in order to avoid redundant work. In this paper, we analyze...
Roberto J. Bayardo Jr., Daniel P. Miranker