In computer programming, an enumerated type (also called enumeration, enum, or factor in the R programming language, and a categorical variable inâ€¦Â (More)

Semantic Scholar uses AI to extract papers important to this topic.

2011

2011

- Livio Bioglio
- RAIRO - Theor. Inf. and Applic.
- 2011

The calculus of looping sequences is a formalism for describing the evolution of biological systems by means of term rewritingâ€¦Â (More)

Is this relevant?

1999

1999

- Paul A. Cairns
- Softw., Pract. Exper.
- 1999

SUMMARY Java does not contain enumerated types. This paper demonstrates how to produce classes that behave like enumerated typesâ€¦Â (More)

Is this relevant?

Highly Cited

1998

Highly Cited

1998

- Mohammed J. Zaki
- CIKM
- 1998

In this paper we present SPADE, a new algorithm for fast discovery of Sequential Patterns. The existing solutions to this problemâ€¦Â (More)

Is this relevant?

Highly Cited

1995

Highly Cited

1995

- Yau-Tsun Steven Li, Sharad Malik
- 32nd Design Automation Conference
- 1995

Embedded computer systems are characterized by the presence of a processor running application specific dedicated software. Aâ€¦Â (More)

Is this relevant?

Highly Cited

1992

Highly Cited

1992

- Ron Rymon
- KR
- 1992

In many problem domains, solutions take the form of unordered sets. We present the Set-Enumerations (SE)tree a vehicle forâ€¦Â (More)

Is this relevant?

Highly Cited

1991

Highly Cited

1991

- David Avis, Komei Fukuda
- Symposium on Computational Geometry
- 1991

We present a new pivot-based algorithm which can be used with minor modification for the enumeration of the facets of the convexâ€¦Â (More)

Is this relevant?

Highly Cited

1990

Highly Cited

1990

- HervÃ© J. Touati, Hamid Savoj, Bill Lin, Robert K. Brayton, Alberto L. Sangiovanni-Vincentelli
- ICCAD
- 1990

Â

Is this relevant?

Highly Cited

1989

Highly Cited

1989

- Richard M. Karp, Michael Luby, Neal Madras
- J. Algorithms
- 1989

We develop polynomial time Monte-Carlo algorithms which produce good approximate solutions to enumeration problems for which itâ€¦Â (More)

Is this relevant?

Highly Cited

1981

Highly Cited

1981

- Prabhakar Goel
- IEEE Transactions on Computers
- 1981

The D-algorithm (DALG) is shown to be ineffective for the class of combinational logic circuits that is used to implement errorâ€¦Â (More)

Is this relevant?

Highly Cited

1979