Sciweavers

6517 search results - page 139 / 1304
» On optimal service selection
Sort
View
PKC
2000
Springer
120views Cryptology» more  PKC 2000»
15 years 10 months ago
Optimally Efficient Accountable Time-Stamping
Abstract. Efficient secure time-stamping schemes employ a 2-level approach in which the time-stamping service operates in rounds. We say that a time-stamping service is accountable...
Ahto Buldas, Helger Lipmaa, Berry Schoenmakers
TRIDENTCOM
2006
IEEE
16 years 11 days ago
Barcelona's open access network testbed
Abstract— This paper describes the implementation and deployment of a novel architecture for a metropolitan open wireless access network, shared among different service providers...
Jaume Barceló, Carlos Macián, Jorge ...
DAGM
2004
Springer
15 years 11 months ago
Multi-step Entropy Based Sensor Control for Visual Object Tracking
We describe a method for selecting optimal actions affecting the sensors in a probabilistic state estimation framework, with an application in selecting optimal zoom levels for a ...
Benjamin Deutsch, Matthias Zobel, Joachim Denzler,...
EOR
2007
92views more  EOR 2007»
15 years 6 months ago
Planning and approximation models for delivery route based services with price-sensitive demands
Classical vehicle routing problems typically do not consider the impact of delivery price on the demand for delivery services. Existing models seek the minimum sum of tour lengths...
Joseph Geunes, Zuo-Jun Max Shen, Akin Emir
GECCO
2008
Springer
118views Optimization» more  GECCO 2008»
15 years 7 months ago
An analysis of multi-sampled issue and no-replacement tournament selection
Standard tournament selection samples individuals with replacement. The sampling-with-replacement strategy has its advantages but also has issues. One of the commonly recognised i...
Huayang Xie, Mengjie Zhang, Peter Andreae, Mark Jo...