Sciweavers

339 search results - page 24 / 68
» Is the Euclidean algorithm optimal among its peers
Sort
View
CIKM
2005
Springer
14 years 2 months ago
Selectivity-based partitioning: a divide-and-union paradigm for effective query optimization
Modern query optimizers select an efficient join ordering for a physical execution plan based essentially on the average join selectivity factors among the referenced tables. In ...
Neoklis Polyzotis
IPPS
2009
IEEE
14 years 3 months ago
Adaptative clustering Particle Swarm Optimization
—The performance of Particle Swarm Optimization (PSO) algorithms depends strongly upon the interaction among the particles. The existing communication topologies for PSO (e.g. st...
Salomão S. Madeiro, Carmelo J. A. Bastos Fi...
CIA
2006
Springer
14 years 12 days ago
Learning to Negotiate Optimally in Non-stationary Environments
Abstract. We adopt the Markov chain framework to model bilateral negotiations among agents in dynamic environments and use Bayesian learning to enable them to learn an optimal stra...
Vidya Narayanan, Nicholas R. Jennings
PIMRC
2008
IEEE
14 years 3 months ago
Distributed network utility optimization in wireless sensor networks using power control
—We extend the existing network utility maximization (NUM) framework for wired networks to wireless sensor networks by formulating it in order to take into account interference a...
George Tichogiorgos, Kin K. Leung, Archan Misra, T...
ICRA
2009
IEEE
122views Robotics» more  ICRA 2009»
14 years 3 months ago
Probabilistic search optimization and mission assignment for heterogeneous autonomous agents
— This paper presents an algorithmic framework for conducting search and identification missions using multiple heterogeneous agents. Dynamic objects of type “neutral” or ...
Timothy H. Chung, Moshe Kress, Johannes O. Royset