Sciweavers

2466 search results - page 105 / 494
» Algorithms for distributed functional monitoring
Sort
View
120
Voted
PPSN
2010
Springer
15 years 27 days ago
General Lower Bounds for the Running Time of Evolutionary Algorithms
Abstract. We present a new method for proving lower bounds in evolutionary computation based on fitness-level arguments and an additional condition on transition probabilities bet...
Dirk Sudholt
97
Voted
TKDE
2002
141views more  TKDE 2002»
15 years 2 months ago
Algorithms for Finding Attribute Value Group for Binary Segmentation of Categorical Databases
We consider the problem of finding a set of attribute values that give a high quality binary segmentation of a database. The quality of a segmentation is defined by an objective fu...
Yasuhiko Morimoto, Takeshi Fukuda, Takeshi Tokuyam...
GI
2004
Springer
15 years 8 months ago
Comparison of Load Balancing Algorithms for Structured Peer-to-Peer Systems
Abstract: Among other things, Peer-to-Peer (P2P) systems are very useful for managing large amounts of widely distributed data. Distributed Hash Tables (DHT) offer a highly scalabl...
Simon Rieche, Leo Petrak, Klaus Wehrle
IJAR
2006
103views more  IJAR 2006»
15 years 2 months ago
Computing mean and variance under Dempster-Shafer uncertainty: Towards faster algorithms
In many real-life situations, we only have partial information about the actual probability distribution. For example, under Dempster-Shafer uncertainty, we only know the masses m...
Vladik Kreinovich, Gang Xiang, Scott Ferson
225
Voted
ICDE
2006
IEEE
144views Database» more  ICDE 2006»
16 years 3 months ago
Approximately Processing Multi-granularity Aggregate Queries over Data Streams
Aggregate monitoring over data streams is attracting more and more attention in research community due to its broad potential applications. Existing methods suffer two problems, 1...
Shouke Qin, Weining Qian, Aoying Zhou