- Computing and Information Systems - Research Publications
Computing and Information Systems - Research Publications
Permanent URI for this collection
Search Results
Now showing
1 - 10 of 11
-
ItemExpanding the Training Data Space Using Emerging Patterns and Genetic MethodsKOTAGIRI, R. ; AL HAMMADY, H. (Society for Industrial and Applied Mathematics, 2005)
-
ItemA Peer-to-Peer Collaborative Intrusion Detection SystemZHOU, CV ; KARUNASEKERA, SA ; LECKIE, CA (IEEE - Institute of Electrical and Electronic Engineers, 2005)
-
ItemNew construction of low correlation zone sequences from hadamard matricesTang, X ; Udaya, P (IEEE, 2005-01-01)
-
ItemFrom single static to multiple dynamic combinatorial auctionsPerugini, D ; Lambert, D ; Sterling, L ; Pearce, A ; Skowron, A ; Barthes, JP ; Jain, L ; Sun, R ; MorizetMahoundeaux, P ; Liu, J ; Zhong, N (IEEE COMPUTER SOC, 2005)
-
ItemBloom filters for data aggregation and discovery: a hierarchical clustering approachHebden, P ; Pearce, AR (IEEE, 2005)
-
ItemAnomaly detection for Internet wormsAl-Hammadi, Y ; Leckie, C ; Clemm, A ; Festor, O ; Pras, A (IEEE, 2005)
-
ItemSemantic-compensation-based recovery in multi-agent systemsUnruh, A ; Harjadi, H ; Bailey, J ; Ramamohanarai, K (IEEE, 2005)
-
ItemDiscovery of minimal unsatisfiable subsets of constraints using hitting set dualizationBailey, J ; Stuckey, PJ ; Hermenegildo, M ; Cabeza, D (SPRINGER-VERLAG BERLIN, 2005)
-
ItemSolving set constraint satisfaction problems using ROBDDSHawkins, P ; Lagoon, V ; Stuckey, PJ (AI ACCESS FOUNDATION, 2005)In this paper we present a new approach to modeling finite set domain constraint problems using Reduced Ordered Binary Decision Diagrams (ROBDDs). We show that it is possible to construct an efficient set domain propagator which compactly represents many set domains and set constraints using ROBDDs. We demonstrate that the ROBDD-based approach provides unprecedented flexibility in modeling constraint satisfaction problems, leading to performance improvements. We also show that the ROBDD-based modeling approach can be extended to the modeling of integer and multiset constraint problems in a straightforward manner. Since domain propagation is not always practical, we also show how to incorporate less strict consistency notions into the ROBDD framework, such as set bounds, cardinality bounds and lexicographic bounds consistency. Finally, we present experimental results that demonstrate the ROBDD-based solver performs better than various more conventional constraint solvers on several standard set constraint problems.
-
ItemDisambiguating Japanese Compound VerbsUCHIYAMA, K. ; BALDWIN, T. ; ISHIZAKI, S. ( 2005)