3653 search results - page 412 / 731 » On Recognizable Timed Languages |
196
click to vote
TSD
2007
Springer
16 years 24 days ago
2007
Springer
Many state-of-the-art statistical parsers for English can be viewed as Probabilistic Context-Free Grammars (PCFGs) acquired from treebanks consisting of phrase-structure trees enri...
175
click to vote
PLDI
2006
ACM
16 years 20 days ago
2006
ACM
The widely used Mark-and-Sweep garbage collector has a drawback in that it does not move objects during collection. As a result, large long-running realistic applications, such as...
162
click to vote
SYNASC
2005
IEEE
16 years 8 days ago
2005
IEEE
We improve, by using register machines, some existing universality results for specific models of P systems. P systems with membrane creation are known to generate all recursivel...
206
click to vote
AISADM
2005
Springer
16 years 7 days ago
2005
Springer
Computer programming of complex systems is a time consuming effort. Results are often brittle and inflexible. Evolving, self-learning flexible multi-agent systems remain a distant ...
194
click to vote
CCS
2005
ACM
16 years 7 days ago
2005
ACM
The NRL Protocol Analyzer (NPA) is a tool for the formal specification and analysis of cryptographic protocols that has been used with great effect on a number of complex real-l...