Sciweavers

4940 search results - page 708 / 988
» On the Complexity of Universal Programs
Sort
View
ATAL
2008
Springer
15 years 8 months ago
Comparing winner determination algorithms for mixed multi-unit combinatorial auctions
Mixed multi-unit combinatorial auctions are combinatorial auctions in which the auctioneer and the bidders negotiate over transformations rather than over simple goods. By proposi...
Brammert Ottens, Ulle Endriss
AUTONOMICS
2008
ACM
15 years 8 months ago
Verification and semantic parallelization of goal-driven autonomous software
Future space missions such as the Mars Science Laboratory demand the engineering of some of the most complex manrated autonomous software systems. According to some recent estimat...
Damian Dechev, Nicolas Rouquette, Peter Pirkelbaue...
BPM
2008
Springer
125views Business» more  BPM 2008»
15 years 8 months ago
Checking Compliance of Execution Traces to Business Rules
Complex and flexible business processes are critical not only because they are difficult to handle, but also because they often tend to loose their intelligibility. Verifying compl...
Federico Chesani, Paola Mello, Marco Montali, Fabr...
CSL
2008
Springer
15 years 8 months ago
On the Almighty Wand
We investigate decidability, complexity and expressive power issues for (first-order) separation logic with one record field (herein called SL) and its fragments. SL can specify pr...
Rémi Brochenin, Stéphane Demri, &Eac...
DCOSS
2008
Springer
15 years 8 months ago
Decoding Code on a Sensor Node
Abstract. Wireless sensor networks come of age and start moving out of the laboratory into the field. As the number of deployments is increasing the need for an efficient and relia...
Pascal von Rickenbach, Roger Wattenhofer