Sciweavers

1002 search results - page 158 / 201
» Towards Graph Programs for Graph Algorithms
Sort
View
ECOOP
1997
Springer
15 years 6 months ago
Near Optimal Hierarchical Encoding of Types
A type inclusion test is a procedure to decide whether two types are related by a given subtyping relationship. An efficient implementation of the type inclusion test plays an impo...
Andreas Krall, Jan Vitek, R. Nigel Horspool
TCAD
2002
98views more  TCAD 2002»
15 years 1 months ago
An Esterel compiler for large control-dominated systems
Embedded hard real-time software systems often need fine-grained parallelism and precise control of timing, things typical real-time operating systems do not provide. The Esterel l...
Stephen A. Edwards
SIAMDM
2010
101views more  SIAMDM 2010»
14 years 8 months ago
Rationality and Strongly Polynomial Solvability of Eisenberg--Gale Markets with Two Agents
Inspired by the convex program of Eisenberg and Gale which captures Fisher markets with linear utilities, Jain and Vazirani [STOC, 2007] introduced the class of EisenbergGale (EG)...
Deeparnab Chakrabarty, Nikhil R. Devanur, Vijay V....
CC
2004
Springer
15 years 7 months ago
Using Multiple Memory Access Instructions for Reducing Code Size
An important issue in embedded systems design is the size of programs. As computing devices decrease in size, yet with more and more functions, better code size optimizations are i...
Neil Johnson, Alan Mycroft
ECOOP
1998
Springer
15 years 6 months ago
Cyclic Distributed Garbage Collection with Group Merger
This paper presents a new algorithm for distributed garbage collection and outlines its implementation within the Network Objects system. The algorithm is based on a reference list...
Helena Rodrigues, Richard E. Jones