Sciweavers

3357 search results - page 126 / 672
» Controlling Complexity
Sort
View
ENTCS
2006
126views more  ENTCS 2006»
15 years 1 months ago
An Applicative Control-Flow Graph Based on Huet's Zipper
We are using ML to build a compiler that does low-level optimization. To support optimizations in classic imperative style, we built a control-flow graph using mutable pointers an...
Norman Ramsey, João Dias
CORR
2007
Springer
47views Education» more  CORR 2007»
15 years 1 months ago
Resource control of object-oriented programs
A sup-interpretation is a tool which provides an upper bound on the size of a value computed by some symbol of a program. Supinterpretations have shown their interest to deal with...
Jean-Yves Marion, Romain Péchoux
INFOCOM
2003
IEEE
15 years 7 months ago
Time-Optimal Network Queue Control: The Case of a Single Congested Node
-We solve the problem of time-optimal network queue control: what are the input data rates that make network queue sizes converge to their ideal size in the least possible time aft...
Mahadevan Iyer, Wei Kang Tsai
112
Voted
FTCS
1998
79views more  FTCS 1998»
15 years 3 months ago
Proving Correctness of a Controller Algorithm for the RAID Level 5 System
Most RAID controllers implemented in industry are complicated and di cult to reason about. This complexity has led to software and hardware systems that are di cult to debug and h...
Mandana Vaziri, Nancy A. Lynch, Jeannette M. Wing
ESCIENCE
2006
IEEE
15 years 3 months ago
Domain Based Access Control Model for Distributed Collaborative Applications
This paper describes the design and development of a flexible domain-based access control infrastructure for distributed Collaborative Environments. The paper proposes extensions ...
Yuri Demchenko, Cees de Laat, Leon Gommans, Ren&ea...