Sciweavers

518 search results - page 86 / 104
» Dynamic Oscillating Search algorithm for feature selection
Sort
View
PERCOM
2008
ACM
13 years 7 months ago
CASD: Management of a context-aware service directory
Traditional web service discovery is strongly related to the use of service directories. Especially in the case of mobile web services, where both service requestors and providers...
Christos Doulkeridis, Michalis Vazirgiannis
TALG
2008
124views more  TALG 2008»
13 years 7 months ago
Uniform deterministic dictionaries
Abstract. We present a new analysis of the well-known family of multiplicative hash functions, and improved deterministic algorithms for selecting "good" hash functions. ...
Milan Ruzic
PE
2010
Springer
170views Optimization» more  PE 2010»
13 years 6 months ago
Approximating passage time distributions in queueing models by Bayesian expansion
We introduce Bayesian Expansion (BE), an approximate numerical technique for passage time distribution analysis in queueing networks. BE uses a class of Bayesian networks to appro...
Giuliano Casale
PVLDB
2010
190views more  PVLDB 2010»
13 years 2 months ago
Efficient B-tree Based Indexing for Cloud Data Processing
A Cloud may be seen as a type of flexible computing infrastructure consisting of many compute nodes, where resizable computing capacities can be provided to different customers. T...
Sai Wu, Dawei Jiang, Beng Chin Ooi, Kun-Lung Wu
EOR
2008
75views more  EOR 2008»
13 years 7 months ago
Soft car sequencing with colors: Lower bounds and optimality proofs
This paper is a study of the car sequencing problem, when feature spacing constraints are soft and colors of vehicles are taken into account. Both pseudo-polynomial algorithms and ...
Thierry Benoist