876 search results - page 33 / 176 » New Results for the Martin Polynomial |
CPAIOR
2009
Springer
15 years 6 months ago
2009
Springer
Many real-world problems require the enumeration of all solutions of combinatorial search problems, even though this is often infeasible in practice. However, not always all parts ...
IFSA
2007
Springer
15 years 6 months ago
2007
Springer
One of the important components of granular computing is interval computations. In interval computations, at each intermediate stage of the computation, we have intervals of possi...
111
click to vote
IPL
2007
14 years 11 months ago
2007
A new algorithm is presented for testing if a regular language is locally threshold testable. The new algorithm is slower than existing algorithms, but its correctness proof is sh...
JSCIC
2011
14 years 6 months ago
2011
Abstract The flux reconstruction approach to high-order methods is robust, efficient, simple to implement, and allows various high-order schemes, such as the nodal discontinuous ...
KDD
2001
ACM
16 years 8 days ago
2001
ACM
The problem of similarity search (query-by-content) has attracted much research interest. It is a difficult problem because of the inherently high dimensionality of the data. The ...