Sciweavers

5864 search results - page 1117 / 1173
» Can We Work around Numerical Methods
Sort
View
P2P
2007
IEEE
15 years 11 months ago
A Data Placement Scheme with Time-Related Model for P2P Storages
Maintaining desired data availability while minimizing costs is the primary challenge in designing P2P storages. Data placement schemes and data availability calculation methods a...
Jing Tian, Zhi Yang, Yafei Dai
LCTRTS
2007
Springer
15 years 11 months ago
Scratchpad allocation for data aggregates in superperfect graphs
Existing methods place data or code in scratchpad memory, i.e., SPM by either relying on heuristics or resorting to integer programming or mapping it to a graph coloring problem. ...
Lian Li 0002, Quan Hoang Nguyen, Jingling Xue
140
Voted
EICS
2009
ACM
15 years 9 months ago
Adapting ubicomp software and its evaluation
We describe work in progress on tools and infrastructure to support adaptive component-based software for mobile devices— in our case, Apple iPhones. Our high level aim is ‘de...
Malcolm Hall, Marek Bell, Alistair Morrison, Stuar...
ECOOPW
1999
Springer
15 years 9 months ago
Providing Policy-Neutral and Transparent Access Control in Extensible Systems
Extensible systems, such as Java or the SPIN extensible operating system, allow for units of code, or extensions, to be added to a running system in almost arbitrary fashion. Exte...
Robert Grimm, Brian N. Bershad
DAC
1994
ACM
15 years 9 months ago
A Communicating Petri Net Model for the Design of Concurrent Asynchronous Modules
Current asynchronous tools are focussed mainly on the design of a single interface module. In many applications, one must design interacting interface modules that potentially comm...
Gjalt G. de Jong, Bill Lin
« Prev « First page 1117 / 1173 Last » Next »