1445 search results - page 179 / 289 » Uniformly Hard Languages |
139
click to vote
JELIA
2004
Springer
15 years 9 months ago
2004
Springer
Abstract. The growing size of electronically available text corpora like companies’ intranets or the WWW has made information access a hot topic within computational linguistics....
123
click to vote
CEC
2003
IEEE
15 years 9 months ago
2003
IEEE
Learning Deterministic Finite Automata (DFA) is a hard task that has been much studied within machine learning and evolutionary computation research. This paper presents a new met...
127
click to vote
ICALP
2010
Springer
15 years 9 months ago
2010
Springer
Graph transformation works under a whole-world assumption. In modelling realistic systems, this typically makes for large graphs and sometimes also large, hard to understand rules....
145
click to vote
MODELS
2009
Springer
15 years 8 months ago
2009
Springer
Abstract. Predefined composite operations are handy for efficient modeling, e.g., for the automatic execution of refactorings, and for the introduction of patterns in existing mod...
146
click to vote
TOOLS
2000
IEEE
15 years 8 months ago
2000
IEEE
UML is widely used today for modelling complex systems. However, the tools support capabilities for UML is limited, partially due to its lack of precise semantics. There are some ...