ACM Home Page

Searching within The Guide for: CCS:F4  (start a new search)

Found 23,964 of 1,394,228

REFINE YOUR SEARCH

ADVANCED SEARCH
Advanced search.  Advanced Search

FEEDBACK
Please provide us with feedback. Please provide us with feedback

Found 23,964 of 1,394,228

Results 1 - 20 of 23,964
Sort by in
Result page: 1   2   3   4   5   6   7   8   9   10    next    >>
1
The step-2 nilpotent (n,n(n+1)/2) sub-Riemannian geometry
April 2006
Journal of Dynamical and Control Systems , Volume 12 Issue 2
Publisher: Kluwer Academic Publishers
Additional Information:full citation, abstract, references, index terms
Bibliometrics:  Downloads (6 Weeks): n/a,   Downloads (12 Months): n/a,   Downloads (Overall): n/a,    Citation Count: 0

We study the sub-Riemannian structure determined by a left-invariant distribution of rank n on a step-2 simply-connected nilpotent Lie group G of dimension n(n+1)/2. We describe a transitive group action that leaves invariant ...


Keywords: exponential mapping, extremal curves, nilpotent Lie algebras, sub-Riemannian geodesics
2
Verifying infinite state processes with sequential and parallel composition
January 1995
POPL '95: Proceedings of the 22nd ACM SIGPLAN-SIGACT symposium on Principles of programming languages
Publisher: ACM Request Permissions Request Permissions   
Full text available: PdfPdf (1.29 MB)
Additional Information:full citation, abstract, references, cited by, index terms
Bibliometrics:  Downloads (6 Weeks): 2,   Downloads (12 Months): 20,   Downloads (Overall): 209,    Citation Count: 1

We investigate the verification problem of infinite-state process w.r.t. logic-based specifications that express properties which may be nonregular. We consider the process algebra PA which integrates and strictly subsumes the algebras BPA (basic process ...

3
Defining and detecting feature interactions
January 1997
Proceedings of the IFIP TC 2 WG 2.1 international workshop on Algorithmic languages and calculi
Publisher: Chapman & Hall, Ltd.
Additional Information:full citation, cited by, index terms
Bibliometrics:  Downloads (6 Weeks): n/a,   Downloads (12 Months): n/a,   Downloads (Overall): n/a,    Citation Count: 1

Keywords: feature interactions, logic programming, relational specifications
4
Undecidability results for low complexity time classes
April 2000
Journal of Computer and System Sciences , Volume 60 Issue 2
Publisher: Academic Press, Inc.
Additional Information:full citation, index terms
Bibliometrics:  Downloads (6 Weeks): n/a,   Downloads (12 Months): n/a,   Downloads (Overall): n/a,    Citation Count: 1
5
Connection calculus theorem proving with multiple built-in theories
February 2000
Journal of Symbolic Computation , Volume 29 Issue 2
Publisher: Academic Press, Inc.
Additional Information:full citation, index terms
Bibliometrics:  Downloads (6 Weeks): n/a,   Downloads (12 Months): n/a,   Downloads (Overall): n/a,    Citation Count: 0
6
Similarity rules and gradual rules for analogical and interpolative reasoning with imprecise data
May 1998
Fuzzy Sets and Systems , Volume 96 Issue 1
Publisher: Elsevier North-Holland, Inc.
Additional Information:full citation, cited by, index terms
Bibliometrics:  Downloads (6 Weeks): n/a,   Downloads (12 Months): n/a,   Downloads (Overall): n/a,    Citation Count: 1

Keywords: analogical reasoning, approximate reasoning, interpolative reasoning, qualitative reasoning
7
Off to new shores: conceptual knowledge discovery and processing
September 2003
International Journal of Human-Computer Studies , Volume 59 Issue 3
Publisher: Academic Press, Inc.
Additional Information:full citation, abstract, references, index terms
Bibliometrics:  Downloads (6 Weeks): n/a,   Downloads (12 Months): n/a,   Downloads (Overall): n/a,    Citation Count: 1

In the last years, the main orientation of formal concept analysis (FCA) has turned from mathematics towards computer science. This article provides a review of this new orientation and analyses why and how FCA and computer science attracted each other. ...


Keywords: formal concept analysis, knowledge discovery, knowledge engineering, ontologies
8
Fuzzy structures on hyper K-algebras
February 2002
International Journal of Uncertainty, Fuzziness and Knowledge-Based Systems , Volume 10 Issue 1
Publisher: World Scientific Publishing Co., Inc.
Additional Information:full citation, abstract, references, index terms
Bibliometrics:  Downloads (6 Weeks): n/a,   Downloads (12 Months): n/a,   Downloads (Overall): n/a,    Citation Count: 0

In this note first we define the notions of fuzzy hyperK-subalgebra and fuzzy (weak) hyperK-ideal of a hyperK-algebra. Then we state and prove some equivalent conditions for these notions. In particular we conclude that any fuzzy ...


Keywords: fuzzy (weak) hyperK-ideal, fuzzy hyperK-subalgebra, hyperK-algebra
9
Bounded delay L codes
July 1991
Theoretical Computer Science , Volume 84 Issue 2
Publisher: Elsevier Science Publishers Ltd.
Additional Information:full citation, index terms, review
Bibliometrics:  Downloads (6 Weeks): n/a,   Downloads (12 Months): n/a,   Downloads (Overall): n/a,    Citation Count: 0
10
Higher-order pattern complement and the strict λ-calculus
October 2003
Transactions on Computational Logic (TOCL) , Volume 4 Issue 4
Publisher: ACM Request Permissions Request Permissions   
Full text available: PdfPdf (333.69 KB)
Additional Information:full citation, abstract, references, cited by, index terms
Bibliometrics:  Downloads (6 Weeks): 7,   Downloads (12 Months): 33,   Downloads (Overall): 283,    Citation Count: 2

We address the problem of complementing higher-order patterns without repetitions of existential variables. Differently from the first-order case, the complement of a pattern cannot, in general, be described by a pattern, or even by a finite set of patterns. ...


Keywords: Complement, higher-order patterns, strict λ-calculus
11
Preface
January 2008
Electronic Notes in Theoretical Computer Science (ENTCS) , Volume 194 Issue 3
Publisher: Elsevier Science Publishers B. V.
Additional Information:full citation, index terms
Bibliometrics:  Downloads (6 Weeks): n/a,   Downloads (12 Months): n/a,   Downloads (Overall): n/a,    Citation Count: 0
12
Terminological logic users workshop Technical University of Berlin, October 24–25, 1991: summary report
April 1992
SIGART Bulletin , Volume 3 Issue 2
Publisher: ACM
Full text available: PdfPdf (220.93 KB)
Additional Information:full citation, index terms
Bibliometrics:  Downloads (6 Weeks): 1,   Downloads (12 Months): 4,   Downloads (Overall): 29,    Citation Count: 0
13
Optimal probabilistic allocation of customer types to servers
May 1995
SIGMETRICS '95/PERFORMANCE '95: Proceedings of the 1995 ACM SIGMETRICS joint international conference on Measurement and modeling of computer systems
Publisher: ACM Request Permissions Request Permissions   
Full text available: PdfPdf (839.16 KB)
Additional Information:full citation, abstract, references, cited by, index terms
Bibliometrics:  Downloads (6 Weeks): 1,   Downloads (12 Months): 10,   Downloads (Overall): 138,    Citation Count: 6

The model under consideration consists of n customer types attended by m parallel non-identical servers. Customers are allocated to the servers in a probabilistic manner; upon arrival customers are sent to one of the servers according to ...


Also published in:
May 1995 SIGMETRICS Performance Evaluation Review Volume 23 Issue 1
14
Transforming constraint logic programs
October 1998
Theoretical Computer Science , Volume 206 Issue 1-2
Publisher: Elsevier Science Publishers Ltd.
Additional Information:full citation, cited by, index terms, review
Bibliometrics:  Downloads (6 Weeks): n/a,   Downloads (12 Months): n/a,   Downloads (Overall): n/a,    Citation Count: 3

Keywords: constraint logic programs, correctness, least fixpoint semantics, program transformations
15
Recursive Computation of Trispectrum
October 2006
IEICE Transactions on Fundamentals of Electronics, Communications and Computer Sciences , Volume E89-A Issue 10
Publisher: Oxford University Press
Additional Information:full citation, abstract, index terms
Bibliometrics:  Downloads (6 Weeks): n/a,   Downloads (12 Months): n/a,   Downloads (Overall): n/a,    Citation Count: 0

If the signal is not Gaussian, then the power spectral density (PSD) approach is insufficient to analyze signals and we resort to estimate the higher order spectra of the signal. However, estimation of the higher order spectra is even more time consuming, ...


Keywords: power spectral density (PSD), periodogram, bispectrum, trispectrum, sliding DFT
16
Petri nets as intermediate representation between VHDL and symbolic transition systems
September 1994
EURO-DAC '94: Proceedings of the conference on European design automation
Publisher: IEEE Computer Society Press
Full text available: PdfPdf (617.90 KB)
Additional Information:full citation, references, cited by, index terms
Bibliometrics:  Downloads (6 Weeks): 8,   Downloads (12 Months): 16,   Downloads (Overall): 153,    Citation Count: 2
17
Abstract computability and algebraic specification
April 2002
Transactions on Computational Logic (TOCL) , Volume 3 Issue 2
Publisher: ACM Request Permissions Request Permissions   
Full text available: PdfPdf (494.44 KB)
Additional Information:full citation, abstract, references, cited by, index terms
Bibliometrics:  Downloads (6 Weeks): 17,   Downloads (12 Months): 97,   Downloads (Overall): 1942,    Citation Count: 2

Abstract computable functions are defined by abstract finite deterministic algorithms on many-sorted algebras. We show that there exist finite universal algebraic specifications that specify uniquely (up to isomorphism) (i) all abstract computable ...


Keywords: Abstract computability, algebraic specification, computable analysis, conditional equations, equational logic, metric algebras, topological algebras
18
Relational interpretations of recursive types in an operational setting
November 1999
Information and Computation , Volume 155 Issue 1-2
Publisher: Academic Press, Inc.
Additional Information:full citation, cited by, index terms
Bibliometrics:  Downloads (6 Weeks): n/a,   Downloads (12 Months): n/a,   Downloads (Overall): n/a,    Citation Count: 5
19
A tool for teaching LL and LR parsing algorithms
June 2008
ITiCSE '08: Proceedings of the 13th annual conference on Innovation and technology in computer science education
Publisher: ACM Request Permissions Request Permissions   
Full text available: PdfPdf (97.83 KB)
Additional Information:full citation, abstract, references, index terms
Bibliometrics:  Downloads (6 Weeks): 3,   Downloads (12 Months): 36,   Downloads (Overall): 48,    Citation Count: 1

In this paper we present a tool to assist in teaching top-down and bottom-up analysis algorithms. The tool provides simulation for the following analysis algorithms: LL, SLR, LALR and LR. During the simulation the student can simultaneously see the pending ...


Keywords: LL parsing, LR parsing, interactive teaching tool
20
On the computational completeness of context-free parallel communicating grammar systems
February 1999
Theoretical Computer Science , Volume 215 Issue 1-2
Publisher: Elsevier Science Publishers Ltd.
Additional Information:full citation, cited by, index terms
Bibliometrics:  Downloads (6 Weeks): n/a,   Downloads (12 Months): n/a,   Downloads (Overall): n/a,    Citation Count: 3

Keywords: computational completeness, distributed computation, parallel communicating grammar systems
Result page: 1   2   3   4   5   6   7   8   9   10    next    >>