2098 search results - page 38 / 420 » The Persistent Abstract Machine |
159
click to vote
HOTOS
1993
IEEE
15 years 8 months ago
1993
IEEE
I argue against trying to solve the problem of clustering objects into disk pages. Instead, I propose that objects be fetched in groups that may be specific to an application or ...
172
click to vote
OMER
2001
15 years 5 months ago
2001
Abstract: To synchronize concurrent regions of a state machine, the Unified Modeling Language (UML) provides the concept of so-called "synch states". Synch states insure ...
132
click to vote
CORR
2010
Springer
15 years 4 months ago
2010
Springer
Due to its optimality on a single machine for the problem of minimizing average flow time, ShortestRemaining-Processing-Time (SRPT) appears to be the most natural algorithm to con...
138
click to vote
AUSAI
2007
Springer
15 years 10 months ago
2007
Springer
Abstract. We provide a conceptual analysis of several kinds of deadlines, represented in Temporal Modal Defeasible Logic. The paper presents a typology of deadlines, based on the f...
120
click to vote
SAS
2005
Springer
15 years 10 months ago
2005
Springer
Abstract. We introduce Banshee, a toolkit for constructing constraintbased analyses. Banshee’s novel features include a code generator for creating customized constraint resoluti...