952 search results - page 161 / 191 » Computational complexity of stochastic programming problems |
129
click to vote
EMSOFT
2009
Springer
15 years 6 months ago
2009
Springer
This paper addresses the question of producing modular sequential imperative code from synchronous data-flow networks. Precisely, given a system with several input and output flow...
125
Voted
CADE
2007
Springer
16 years 2 months ago
2007
Springer
Boolean Algebra with Presburger Arithmetic (BAPA) is a decidable logic that combines 1) Boolean algebra of sets of uninterpreted elements (BA) and 2) Presburger arithmetic (PA). BA...
168
Voted
CI
2000
15 years 2 months ago
2000
Kowalski and Sergot's Event Calculus (EC) is a simple temporal formalism that, given a set of event occurrences, derives the maximal validity intervals (MVIs) over which prop...
139
click to vote
JPDC
2000
15 years 2 months ago
2000
: SIMD arrays are likely to become increasingly important as coprocessors in domain specific systems as architects continue to leverage RAM technology in their design. The problem ...
114
Voted
ICC
2007
IEEE
15 years 9 months ago
2007
IEEE
— High power dissipation in packet switches and routers is fast turning into a key problem, owing to increasing line speeds and decreasing chip sizes. To address this issue, we i...