Sciweavers

3825 search results - page 448 / 765
» The Language of Time: A Reader
Sort
View
TSD
2007
Springer
16 years 1 months ago
Accurate Unlexicalized Parsing for Modern Hebrew
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...
Reut Tsarfaty, Khalil Sima'an
PLDI
2006
ACM
16 years 25 days ago
The Compressor: concurrent, incremental, and parallel compaction
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...
Haim Kermany, Erez Petrank
SYNASC
2005
IEEE
86views Algorithms» more  SYNASC 2005»
16 years 14 days ago
One and Two Polarizations, Membrane Creation and Objects Complexity in P Systems
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...
Artiom Alhazov, Rudolf Freund, Agustin Riscos-N&ua...
AISADM
2005
Springer
16 years 13 days ago
Evolving Agents: Communication and Cognition
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 ...
Leonid I. Perlovsky
CCS
2005
ACM
16 years 13 days ago
A rewriting-based inference system for the NRL protocol analyzer: grammar generation
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...
Santiago Escobar, Catherine Meadows, José M...