Sciweavers

3653 search results - page 466 / 731
» Learning of Partial Languages
Sort
View
OOPSLA
2005
Springer
16 years 5 days ago
Fortune teller: improving garbage collection performance in server environment using live objects prediction
Currently, the most adopted criterion to invoke garbage collection is heap space exhaustion. In other words, garbage collection is invoked when the heap space (either the entire s...
Feng Xian, Witawas Srisa-an, Hong Jiang
PPSWR
2005
Springer
16 years 5 days ago
Computational Treatment of Temporal Notions: The CTTN-System
The CTTN-system is a computer program which provides advanced processing or temporal notions. The basic data structures of the CTTN-system are time points, crisp and fuzzy time int...
Hans Jürgen Ohlbach
ICGI
2004
Springer
16 years 2 days ago
Mutually Compatible and Incompatible Merges for the Search of the Smallest Consistent DFA
State Merging algorithms, such as Rodney Price’s EDSM (Evidence-Driven State Merging) algorithm, have been reasonably successful at solving DFA-learning problems. EDSM, however, ...
John Abela, François Coste, Sandro Spina
PEPM
2004
ACM
16 years 1 days ago
Proving termination of membership equational programs
Advanced typing, matching, and evaluation strategy features, as well as very general conditional rules, are routinely used in equational programming languages such as, for example...
Francisco Durán, Salvador Lucas, José...
NDSS
2003
IEEE
15 years 12 months ago
Access Control Based on Execution History
Security is a major, frequent concern in extensible software systems such as Java Virtual Machines and the Common Language Runtime. These systems aim to enable simple, classic app...
Martín Abadi, Cédric Fournet