Sciweavers

2542 search results - page 170 / 509
» Computing Cartograms with Optimal Complexity
Sort
View
153
Voted
SIGMOD
2004
ACM
147views Database» more  SIGMOD 2004»
16 years 1 months ago
Robust Query Processing through Progressive Optimization
Virtually every commercial query optimizer chooses the best plan for a query using a cost model that relies heavily on accurate cardinality estimation. Cardinality estimation erro...
Volker Markl, Vijayshankar Raman, David E. Simmen,...
117
Voted
ARTCOM
2009
IEEE
15 years 7 months ago
An Efficient Bidirectional Frame Prediction Using Particle Swarm Optimization Technique
—This paper presents a Novel Bidirectional motion estimation technique, which is based on the Particle swarm optimization algorithm. Particle swarm optimization (PSO) is a popula...
D. Ranganadham, Pavan Kumar Gorpuni
IPPS
2006
IEEE
15 years 7 months ago
GPU-ABiSort: optimal parallel sorting on stream architectures
In this paper, we present a novel approach for parallel sorting on stream processing architectures. It is based on adaptive bitonic sorting. For sorting n values utilizing p strea...
Alexander Greß, Gabriel Zachmann
AAAI
2010
15 years 2 months ago
Coalition Structure Generation based on Distributed Constraint Optimization
Forming effective coalitions is a major research challenge in AI and multi-agent systems (MAS). Coalition Structure Generation (CSG) involves partitioning a set of agents into coa...
Suguru Ueda, Atsushi Iwasaki, Makoto Yokoo, Marius...
101
Voted
AAAI
1998
15 years 2 months ago
Fast Probabilistic Modeling for Combinatorial Optimization
Probabilistic models have recently been utilized for the optimization of large combinatorial search problems. However, complex probabilistic models that attempt to capture interpa...
Shumeet Baluja, Scott Davies