Sciweavers

361 search results - page 7 / 73
» Average Case Analysis of Dynamic Geometric Optimization
Sort
View
GECCO
2007
Springer
177views Optimization» more  GECCO 2007»
14 years 1 months ago
Geometric particle swarm optimisation on binary and real spaces: from theory to practice
Geometric particle swarm optimization (GPSO) is a recently introduced formal generalization of traditional particle swarm optimization (PSO) that applies naturally to both continu...
Cecilia Di Chio, Alberto Moraglio, Riccardo Poli
CORR
2010
Springer
140views Education» more  CORR 2010»
13 years 7 months ago
Dynamic Vehicle Routing for Data Gathering in Wireless Networks
We consider a dynamic vehicle routing problem in wireless networks where messages arriving randomly in time and space are collected by a mobile receiver (vehicle or a collector). ...
Güner D. Çelik, Eytan Modiano
DAGSTUHL
2004
13 years 8 months ago
The Priority R-Tree: A Practically Efficient and Worst-Case-Optimal R-Tree
We present the Priority R-tree, or PR-tree, which is the first R-tree variant that always answers a window query using O((N/B)1-1/d + T/B) I/Os, where N is the number of ddimensio...
Lars Arge, Mark de Berg, Herman J. Haverkort, Ke Y...
MICRO
2009
IEEE
134views Hardware» more  MICRO 2009»
14 years 1 months ago
A case for dynamic frequency tuning in on-chip networks
Performance and power are the first order design metrics for Network-on-Chips (NoCs) that have become the de-facto standard in providing scalable communication backbones for mult...
Asit K. Mishra, Reetuparna Das, Soumya Eachempati,...
CORR
2007
Springer
126views Education» more  CORR 2007»
13 years 7 months ago
Optimal Throughput-Diversity-Delay Tradeoff in MIMO ARQ Block-Fading Channels
In this paper, we consider an automatic-repeat-request (ARQ) retransmission protocol signaling over a block-fading multiple-input, multiple-output (MIMO) channel. Unlike previous ...
Allen Chuang, Albert Guillen i Fabregas, Lars K. R...