Sciweavers

5314 search results - page 407 / 1063
» Hybrid Dynamic Programming
Sort
View
PADL
2007
Springer
16 years 26 days ago
Partial Evaluation of Pointcuts
Abstract. In aspect-oriented programming, pointcuts are usually compiled by identifying a set of shadows — that is, places in the code whose execution is potentially relevant for...
Karl Klose, Klaus Ostermann, Michael Leuschel
IWMM
1998
Springer
103views Hardware» more  IWMM 1998»
15 years 11 months ago
The Memory Fragmentation Problem: Solved?
We show that for 8 real and varied C and C++ programs, several conventional dynamic storage allocators provide nearzero fragmentation, once we account for overheads due to impleme...
Mark S. Johnstone, Paul R. Wilson
229
Voted
HOTSWUP
2009
ACM
15 years 4 months ago
Migrating Protocols in Multi-Threaded Message-Passing Systems
Dynamic software update is a technique by which a running program can be updated with new code and data without interrupting its execution. Often we will want to preserve properti...
Austin Anderson, Julian Rathke
JMLR
2012
13 years 9 months ago
Perturbation based Large Margin Approach for Ranking
We consider the task of devising large-margin based surrogate losses for the learning to rank problem. In this learning to rank setting, the traditional hinge loss for structured ...
Eunho Yang, Ambuj Tewari, Pradeep D. Ravikumar
GPCE
2007
Springer
16 years 27 days ago
Oz/K: a kernel language for component-based open programming
Programming in an open environment remains challenging because it requires combining modularity, security, concurrency, distribution, and dynamicity. In this paper, we propose an ...
Michael Lienhardt, Alan Schmitt, Jean-Bernard Stef...