Sciweavers

395 search results - page 33 / 79
» Determining the Idle Time of a Tiling: New Results
Sort
View
GECCO
2005
Springer
115views Optimization» more  GECCO 2005»
14 years 1 months ago
Search-based improvement of subsystem decompositions
The subsystem decomposition of a software system degrades gradually during its lifetime and therefore it gets harder and harder to maintain. As a result this decomposition needs t...
Olaf Seng, Markus Bauer, Matthias Biehl, Gert Pach...
SCOPES
2004
Springer
14 years 1 months ago
DSP Code Generation with Optimized Data Word-Length Selection
Digital signal processing applications are implemented in embedded systems with fixed-point arithmetic to minimize the cost and the power consumption. To reduce the application ti...
Daniel Menard, Olivier Sentieys
ATAL
2008
Springer
13 years 9 months ago
Approximate bidding algorithms for a distributed combinatorial auction
Distributed allocation and multiagent coordination problems can be solved through combinatorial auctions (CAs). However, most of the existing winner determination algorithms (WDAs...
Benito Mendoza García, José M. Vidal
CTRSA
2008
Springer
109views Cryptology» more  CTRSA 2008»
13 years 9 months ago
Super-Efficient Verification of Dynamic Outsourced Databases
We develop new algorithmic and cryptographic techniques for authenticating the results of queries over databases that are outsourced to an untrusted responder. We depart from previ...
Michael T. Goodrich, Roberto Tamassia, Nikos Trian...
EOR
2011
124views more  EOR 2011»
13 years 2 months ago
Analysis of order-up-to-level inventory systems with compound Poisson demand
: We analyse a single echelon single item inventory system where the demand and the lead time are stochastic. Demand is modelled as a compound Poisson process and the stock is cont...
M. Zied Babai, Zied Jemaï, Yves Dallery