1221 search results - page 26 / 245 » A Comparison of Two Programming Models for Pervasive Computi... |
106
click to vote
CPAIOR
2007
Springer
15 years 8 months ago
2007
Springer
Many optimisation problems contain substructures involving constraints on sequences of decision variables. Such constraints can be very complex to express with mixed integer progra...
122
click to vote
ICALP
2007
Springer
15 years 8 months ago
2007
Springer
Abstract. We define and study two versions of the bipartite matching problem in the framework of two-stage stochastic optimization with recourse. In one version the uncertainty is...
175
click to vote
DAC
2002
ACM
16 years 2 months ago
2002
ACM
This paper describes the verification of two versions of a bridge between two on-chip buses. The verification was performed just as the Infineon Technologies Design Centre in Bris...
106
Voted
PERCOM
2009
ACM
15 years 8 months ago
2009
ACM
—We present a middleware platform for assembling pervasive applications that demand fault-tolerance and adaptivity in distributed, dynamic environments. Unlike typical adaptive m...
104
click to vote
ICALP
2009
Springer
16 years 2 months ago
2009
Springer
Abstract We revisit the classical QuickSort and QuickSelect algorithms, under a complexity model that fully takes into account the elementary comparisons between symbols composing ...