Sciweavers

1144 search results - page 211 / 229
» Logic programming for combinatorial problems
Sort
View
CORR
2011
Springer
165views Education» more  CORR 2011»
12 years 11 months ago
Tight Upper Bounds for Streett and Parity Complementation
Complementation of finite automata on infinite words is not only a fundamental problem in automata theory, but also serves as a cornerstone for solving numerous decision problem...
Yang Cai, Ting Zhang
PODS
2002
ACM
138views Database» more  PODS 2002»
14 years 7 months ago
Fast Algorithms For Hierarchical Range Histogram Construction
Data Warehousing and OLAPapplications typically view data as having multiple logical dimensions e.g., product, location with natural hierarchies de ned on each dimension. OLAP que...
Sudipto Guha, Nick Koudas, Divesh Srivastava
ACL2
2006
ACM
14 years 1 months ago
Phylogenetic trees in ACL2
Biologists studying the evolutionary relationships between organisms use software packages to solve the computational problems they encounter. Several of these problems involve th...
Warren A. Hunt Jr., Serita M. Nelesen
LICS
2003
IEEE
14 years 27 days ago
Model checking for probability and time: from theory to practice
Probability features increasingly often in software and hardware systems: it is used in distributed co-ordination and routing problems, to model fault-tolerance and performance, a...
Marta Z. Kwiatkowska
ILP
1999
Springer
13 years 12 months ago
Approximate ILP Rules by Backpropagation Neural Network: A Result on Thai Character Recognition
This paper presents an application of Inductive Logic Programming (ILP) and Backpropagation Neural Network (BNN) to the problem of Thai character recognition. In such a learning pr...
Boonserm Kijsirikul, Sukree Sinthupinyo