4117 search results - page 22 / 824 » On the Satisfiability of Complex Constraints |
HAPTICS
2009
IEEE
15 years 4 months ago
2009
IEEE
The force-update-rate requirements of transparent rendering of virtual environments are in conflict with the computational cost required for computing complex interactions betwee...
PODS
2007
ACM
15 years 9 months ago
2007
ACM
In a recent paper, Martens et al. introduced a specification mechanism for XML tree languages, based on rules of the form r s, where r, s are regular expressions. Sets of such ru...
RTSS
1997
IEEE
15 years 1 months ago
1997
IEEE
Resource allocation for high-performance real-time applications is challenging due to the applications' data-dependent nature, dynamic changes in their external environment, ...
ACL
2000
14 years 10 months ago
2000
Dominance constraints are logical descriptions of trees that are widely used in computational linguistics. Their general satisfiability problem is known to be NP-complete. Here we...
AMW
2010
14 years 11 months ago
2010
A Data Warehouse (DW) is a data repository that integrates data from multiple sources and organizes the data according to a set of data structures called dimensions. Each dimension...