70 search results - page 10 / 14 » An Exact Characterization of Greedy Structures |
101
click to vote
MICRO
2005
IEEE
15 years 3 months ago
2005
IEEE
Scheduling algorithms used in compilers traditionally focus on goals such as reducing schedule length and register pressure or producing compact code. In the context of a hardware...
ASIACRYPT
2008
Springer
14 years 11 months ago
2008
Springer
Abstract. In secure computation among a set P of players one considers an adversary who can corrupt certain players. The three usually considered types of corruption are active, pa...
EWSN
2004
Springer
15 years 2 months ago
2004
Springer
Abstract. In this paper, we consider the minimization of a relevant energy consumption related cost function in the context of sensor networks where correlated sources are generate...
102
Voted
CONCUR
2008
Springer
14 years 11 months ago
2008
Springer
Abstract. Comparison between different formalisms and models is often by flattening structure and reducing them to behaviorally equivalent models e.g., automaton and Turing machine...
CADE
2006
Springer
15 years 9 months ago
2006
Springer
Propositional canonical Gentzen-type systems, introduced in [1], are systems which in addition to the standard axioms and structural rules have only logical rules in which exactly ...