Sciweavers

2740 search results - page 103 / 548
» Approximating Component Selection
Sort
View
ATAL
2010
Springer
14 years 11 months ago
Asynchronous algorithms for approximate distributed constraint optimization with quality bounds
Distributed Constraint Optimization (DCOP) is a popular framework for cooperative multi-agent decision making. DCOP is NPhard, so an important line of work focuses on developing f...
Christopher Kiekintveld, Zhengyu Yin, Atul Kumar, ...
ICDE
2012
IEEE
240views Database» more  ICDE 2012»
13 years 13 days ago
Approximate Shortest Distance Computing: A Query-Dependent Local Landmark Scheme
—Shortest distance query between two nodes is a fundamental operation in large-scale networks. Most existing methods in the literature take a landmark embedding approach, which s...
Miao Qiao, Hong Cheng, Lijun Chang, Jeffrey Xu Yu
ICPR
2002
IEEE
15 years 11 months ago
Visual Abstraction of Wildlife Footage Using Gaussian Mixture Models and the Minimum Description Length Criterion
bstraction of Wildlife Footage using Gaussian Mixture Models and the Minimum Description Length Criterion David Gibson Neill Campbell Barry Thomas Department of Computer Science Un...
David P. Gibson, Neill W. Campbell, Barry T. Thoma...
HICSS
2007
IEEE
125views Biometrics» more  HICSS 2007»
15 years 4 months ago
Stochastic Model for Power Grid Dynamics
We introduce a stochastic model that describes the quasistatic dynamics of an electric transmission network under perturbations introduced by random load fluctuations, random rem...
Marian Anghel, Kenneth A. Werley, Adilson E. Motte...
IJCNN
2006
IEEE
15 years 4 months ago
Greedy forward selection algorithms to Sparse Gaussian Process Regression
Abstract— This paper considers the basis vector selection issue invloved in forward selection algorithms to sparse Gaussian Process Regression (GPR). Firstly, we re-examine a pre...
Ping Sun, Xin Yao