1068 search results - page 158 / 214 » For completeness, sublogarithmic space is no space |
APN
1999
Springer
14 years 1 months ago
1999
Springer
Abstract. This paper presents parallel approaches to the complete transient numerical analysis of stochastic reward nets (SRNs) for both shared and distributed-memory machines. Par...
TOOLS
1999
IEEE
14 years 1 months ago
1999
IEEE
The development of large software systems demands intensive cooperation among multiple project team members with different responsibilities. The development process is often distr...
VLDB
1999
ACM
14 years 1 months ago
1999
ACM
We present an optimization method and algorithm designed for three objectives: physical data independence, semantic optimization, and generalized tableau minimization. The method ...
PASTE
1998
ACM
14 years 1 months ago
1998
ACM
Concept analysis transforms any relation between ‘lobjects” and “attributes” into a complete lattice. This concept lattice can be studied by algebraic means and offers rem...
JELIA
1998
Springer
14 years 1 months ago
1998
Springer
Abstract. One of the maincharacteristics of logical reasoning in knowledge based systems is its high computational complexity. Anytime deduction and anytime compilation are two att...