Sciweavers

1242 search results - page 237 / 249
» The Theory of Grammar Constraints
Sort
View
EMSOFT
2004
Springer
14 years 1 months ago
Scheduling within temporal partitions: response-time analysis and server design
As the bandwidth of CPUs and networks continues to grow, it becomes more attractive, for efficiency reasons, to share such resources among several applications with the minimum le...
Luís Almeida, Paulo Pedreiras
ESA
2004
Springer
145views Algorithms» more  ESA 2004»
14 years 1 months ago
Flows on Few Paths: Algorithms and Lower Bounds
Abstract. Classical network flow theory allows decomposition of flow into several chunks of arbitrary sizes traveling through the network on different paths. In the first part ...
Maren Martens, Martin Skutella
PLDI
2003
ACM
14 years 1 months ago
Checking and inferring local non-aliasing
In prior work [15] we studied a language construct restrict that allows programmers to specify that certain pointers are not aliased to other pointers used within a lexical scope....
Alexander Aiken, Jeffrey S. Foster, John Kodumal, ...
PLDI
2003
ACM
14 years 1 months ago
Ownership types for safe region-based memory management in real-time Java
The Real-Time Specification for Java (RTSJ) allows a program to create real-time threads with hard real-time constraints. Real-time threads use region-based memory management to ...
Chandrasekhar Boyapati, Alexandru Salcianu, Willia...
ATAL
2003
Springer
14 years 1 months ago
Team formation and communication restrictions in collectives
A collective of agents often needs to maximize a “world utility” function which rates the performance of an entire system, while subject to communication restrictions among th...
Adrian K. Agogino, Kagan Tumer