1805 search results - page 332 / 361 » A Theory of Closure Operators |
141
click to vote
CASES
2006
ACM
15 years 10 months ago
2006
ACM
Previous object code compression schemes have employed static and semiadaptive compression algorithms to reduce the size of instruction memory in embedded systems. The suggestion ...
133
click to vote
MOBICOM
2006
ACM
15 years 10 months ago
2006
ACM
This paper considers the interaction between channel assignment and distributed scheduling in multi-channel multiradio Wireless Mesh Networks (WMNs). Recently, a number of distrib...
129
click to vote
PLDI
2006
ACM
15 years 10 months ago
2006
ACM
Procedures have long been the basic units of compilation in conventional optimization frameworks. However, procedures are typically formed to serve software engineering rather tha...
125
click to vote
PLDI
2006
ACM
15 years 10 months ago
2006
ACM
Type systems for secure information flow are useful for efficiently checking that programs have secure information flow. They are, however, conservative, so that they often rej...
171
Voted
PODC
2006
ACM
15 years 10 months ago
2006
ACM
Byzantine agreement algorithms typically assume implicit initial state consistency and synchronization among the correct nodes and then operate in coordinated rounds of informatio...