Sciweavers

6054 search results - page 865 / 1211
» Implementation of Andorra-based Languages
Sort
View
FMSD
2008
110views more  FMSD 2008»
15 years 6 months ago
Automatic symbolic compositional verification by learning assumptions
Abstract Compositional reasoning aims to improve scalability of verification tools by reducing the original verification task into subproblems. The simplification is typically base...
Wonhong Nam, P. Madhusudan, Rajeev Alur
CAL
2006
15 years 6 months ago
A Page-based Hybrid (Software-Hardware) Dynamic Memory Allocator
Modern programming languages often include complex mechanisms for dynamic memory allocation and garbage collection. These features drive the need for more efficient implementation ...
Wentong Li, Saraju P. Mohanty, Krishna M. Kavi
CN
2006
106views more  CN 2006»
15 years 6 months ago
Efficient large-scale BGP simulations
Simulation has been the method of choice for analyzing large, complex, and highly volatile systems. One of these systems is the inter-domain routing infrastructure of the Internet...
Xenofontas A. Dimitropoulos, George F. Riley
CORR
2006
Springer
95views Education» more  CORR 2006»
15 years 6 months ago
Naming Games in Spatially-Embedded Random Networks
We investigate a prototypical agent-based model, the Naming Game, on random geometric networks. The Naming Game is a minimal model, employing local communications that captures th...
Qiming Lu, Gyorgy Korniss, Boleslaw K. Szymanski
CSJM
2006
124views more  CSJM 2006»
15 years 6 months ago
Text Classification Using Word-Based PPM Models
Text classification is one of the most actual among the natural language processing problems. In this paper the application of word-based PPM (Prediction by Partial Matching) mode...
Victoria Bobicev