Sciweavers

1529 search results - page 30 / 306
» Search Space Analysis of the Linear Ordering Problem
Sort
View
AUTOMATICA
2010
167views more  AUTOMATICA 2010»
13 years 7 months ago
A new kernel-based approach for linear system identification
This paper describes a new kernel-based approach for linear system identification of stable systems. We model the impulse response as the realization of a Gaussian process whose s...
Gianluigi Pillonetto, Giuseppe De Nicolao
EDBT
2008
ACM
160views Database» more  EDBT 2008»
14 years 7 months ago
Why go logarithmic if we can go linear?: Towards effective distinct counting of search traffic
Estimating the number of distinct elements in a large multiset has several applications, and hence has attracted active research in the past two decades. Several sampling and sket...
Ahmed Metwally, Divyakant Agrawal, Amr El Abbadi
IJCAI
1989
13 years 8 months ago
Parallel Iterative A* Search: An Admissible Distributed Heuristic Search Algorithm
In this paper, a distributed heuristic search algorithm is presented. We show that the algorithm is admissible and give an informal analysis of its load balancing, scalability, an...
Shie-rei Huang, Larry S. Davis
ISCC
2006
IEEE
154views Communications» more  ISCC 2006»
14 years 1 months ago
Decentralized Load Balancing for Highly Irregular Search Problems
In this paper, we present a Dynamic Load Balancing (DLB) policy for problems characterized by a highly irregular search tree, whereby no reliable workload prediction is available....
Giuseppe Di Fatta, Michael R. Berthold
COMPGEOM
2005
ACM
13 years 9 months ago
Fast construction of nets in low dimensional metrics, and their applications
We present a near linear time algorithm for constructing hierarchical nets in finite metric spaces with constant doubling dimension. This data-structure is then applied to obtain...
Sariel Har-Peled, Manor Mendel