Sciweavers

455 search results - page 29 / 91
» Distributed Processes on Tree Hash
Sort
View
AINA
2007
IEEE
14 years 3 months ago
DHTs over Peer Clusters for Distributed Information Retrieval
Distributed Hash Tables (DHTs) are very efficient for querying based on key lookups, if only a small number of keys has to be registered by each individual peer. However, building...
Odysseas Papapetrou, Wolf Siberski, Wolf-Tilo Balk...
GECCO
2005
Springer
154views Optimization» more  GECCO 2005»
14 years 2 months ago
Genetic drift in univariate marginal distribution algorithm
Like Darwinian-type genetic algorithms, there also exists genetic drift in Univariate Marginal Distribution Algorithm (UMDA). Since the universal analysis of genetic drift in UMDA...
Yi Hong, Qingsheng Ren, Jin Zeng
WOA
2007
13 years 10 months ago
An Agent Based Solution for Dispatching Items in a Distributed Environment
—This paper describes Herald, an agent based toolkit for dispatching and processing items in a distributed environment. Herald is suitable for scenarios where the process could b...
Christian Vecchiola, Alberto Grosso, Andrea Passad...
EDOC
2009
IEEE
14 years 20 days ago
Monitoring and Analyzing Influential Factors of Business Process Performance
Abstract--Business activity monitoring enables continuous observation of key performance indicators (KPIs). However, if things go wrong, a deeper analysis of process performance be...
Branimir Wetzstein, Philipp Leitner, Florian Rosen...
SIGMOD
2007
ACM
146views Database» more  SIGMOD 2007»
14 years 9 months ago
Distributed query evaluation with performance guarantees
Partial evaluation has recently proven an effective technique for evaluating Boolean XPath queries over a fragmented tree that is distributed over a number of sites. What left ope...
Gao Cong, Wenfei Fan, Anastasios Kementsietsidis