Sciweavers

526 search results - page 58 / 106
» On the Number of Minimal Addition Chains
Sort
View
ASWSD
2006
Springer
15 years 1 months ago
Reusable Services and Semi-automatic Service Composition for Automotive Software
Automotive software has become an important factor in the development of modern and innovative high-end vehicles. More and more functions can only be realized by the cooperation of...
Holger Giese
CIMAGING
2010
195views Hardware» more  CIMAGING 2010»
14 years 11 months ago
SPIRAL out of convexity: sparsity-regularized algorithms for photon-limited imaging
The observations in many applications consist of counts of discrete events, such as photons hitting a detector, which cannot be effectively modeled using an additive bounded or Ga...
Zachary T. Harmany, Roummel F. Marcia, Rebecca Wil...
AUTOMATICA
2010
94views more  AUTOMATICA 2010»
14 years 10 months ago
Optimality analysis of sensor-target localization geometries
The problem of target localization involves estimating the position of a target from multiple and typically noisy measurements of the target position. It is well known that the re...
Adrian N. Bishop, Baris Fidan, Brian D. O. Anderso...
PE
2006
Springer
111views Optimization» more  PE 2006»
14 years 9 months ago
How many servers are best in a dual-priority M/PH/k system?
We ask the question, "for minimizing mean response time (sojourn time), which is preferable: one fast server of speed 1, or k slow servers each of speed 1/k?" Our settin...
Adam Wierman, Takayuki Osogami, Mor Harchol-Balter...
TALG
2008
97views more  TALG 2008»
14 years 9 months ago
On an infinite family of solvable Hanoi graphs
The Tower of Hanoi problem is generalized by placing pegs on the vertices of a given directed graph G with two distinguished vertices, S and D, and allowing moves only along arcs o...
Dany Azriel, Noam Solomon, Shay Solomon