Sciweavers

376 search results - page 72 / 76
» Solution Counting Algorithms for Constraint-Centered Search ...
Sort
View
KDD
2006
ACM
142views Data Mining» more  KDD 2006»
15 years 10 months ago
Mining distance-based outliers from large databases in any metric space
Let R be a set of objects. An object o R is an outlier, if there exist less than k objects in R whose distances to o are at most r. The values of k, r, and the distance metric ar...
Yufei Tao, Xiaokui Xiao, Shuigeng Zhou
65
Voted
PODS
2003
ACM
113views Database» more  PODS 2003»
15 years 9 months ago
Materializing views with minimal size to answer queries
In this paper we study the following problem. Given a database and a set of queries, we want to find, in advance, a set of views that can compute the answers to the queries, such ...
Rada Chirkova, Chen Li
GPC
2007
Springer
15 years 3 months ago
Optimizing Server Placement for QoS Requirements in Hierarchical Grid Environments
This paper focuses on two problems related to QoS-aware I/O server placement in hierarchical Grid environments. Given a hierarchical network with requests from clients, the network...
Chien-Min Wang, Chun-Chen Hsu, Pangfeng Liu, Hsi-M...
GECCO
2009
Springer
133views Optimization» more  GECCO 2009»
15 years 2 months ago
Evolutionary codings and operators for the terminal assignment problem
Given a collection of terminals, each with a demand, a collection of concentrators, each with a capacity, and costs of connecting the terminals to the concentrators, the terminal ...
Bryant A. Julstrom
ATAL
2007
Springer
15 years 3 months ago
Letting loose a SPIDER on a network of POMDPs: generating quality guaranteed policies
Distributed Partially Observable Markov Decision Problems (Distributed POMDPs) are a popular approach for modeling multi-agent systems acting in uncertain domains. Given the signi...
Pradeep Varakantham, Janusz Marecki, Yuichi Yabu, ...