Steven L Lytinen
Biographic Data
| ID | 6536267 |
|---|---|
| NAME | Steven L Lytinen |
| GIVEN NAMES | Steven L |
| FAMILY NAME | Lytinen |
| SIGNATURE | LYTINEN S L |
| AFFILIATIONS | DePaul University |
| VERIFIED | No |
| TOTAL WORKS | 2 |
| TOTAL CITATIONS | 0 |
| WORKS AS AUTHOR | 2 |
| WORKS AS EDITOR | 0 |
| FIRST PUBLICATION YEAR | 2001 |
| LATEST PUBLICATION YEAR | 2017 |
| H-INDEX | 0 |
Improving Execution Speed of Models Implemented in NetLogo
NetLogo has become a standard platform for agent-based simulation, yet there appears to be widespread \nbelief that it is not suitable for large and complex models due to slow execution. Our experience does \nnot support that belief. NetLogo programs o en do run very slowly when written to minimize code length and \nmaximize clarity, but relatively simple and easily tested changes can almost always produce major increases \nin execution speed. We…
Nonminimal Derivations in Unification-based Parsing
Shieber's abstract parsing algorithm (Shieber 1992) for unification grammars is an extension of Earley's algorithm (Earley 1970) for context-free grammars to feature structures. In this paper, we show that, under certain conditions, Shieber's algorithm produces what we call a nonminimal derivation: a parse tree which contains additional features that are not in the licensing productions. While Shieber's definition of parse tree allows for such no…
No prominent works on this page.
Nonminimal Derivations in Unification-based Parsing
Shieber's abstract parsing algorithm (Shieber 1992) for unification grammars is an extension of Earley's algorithm (Earley 1970) for context-free grammars to feature structures. In this paper, we show that, under certain conditions, Shieber's algorithm produces what we call a nonminimal derivation: a parse tree which contains additional features that are not in the licensing productions. While Shieber's definition of parse tree allows for such no…
Improving Execution Speed of Models Implemented in NetLogo
NetLogo has become a standard platform for agent-based simulation, yet there appears to be widespread \nbelief that it is not suitable for large and complex models due to slow execution. Our experience does \nnot support that belief. NetLogo programs o en do run very slowly when written to minimize code length and \nmaximize clarity, but relatively simple and easily tested changes can almost always produce major increases \nin execution speed. We…
Computer Science (2 works) · Programming language (2 works) · Algorithm (1 work) · Artificial Intelligence (1 work) · Combinatorics (1 work) · Context (archaeology (1 work) · Context-free grammar (1 work) · Extension (predicate logic (1 work) · Feature (linguistics (1 work) · L-attributed grammar (1 work)