Sciweavers

2107 search results - page 260 / 422
» Computing Small Search Numbers in Linear Time
Sort
View
ACMICEC
2007
ACM
127views ECommerce» more  ACMICEC 2007»
14 years 1 months ago
Decentralized task allocation using magnet: an empirical evaluation in the logistics domain
This paper presents a decentralized task allocation method that can handle allocation of tasks with time and precedence constraints in a multi-agent setting where not all informat...
Mark Hoogendoorn, Maria L. Gini, Catholijn M. Jonk...
TCOM
2010
83views more  TCOM 2010»
13 years 4 months ago
Global and Fast Receiver Antenna Selection for MIMO Systems
Abstract--For a multiple-input multiple-output (MIMO) system with more antennas at the receiver than the transmitter, selecting the same number of receiver antennas as the number o...
Bu Hong Wang, Hon Tat Hui, Mook Seng Leong
WDAS
2000
13 years 10 months ago
Scalable Distributed Data Structures: A Survey
This paper reviews literature on scalable data structures for searching in a distributed computing environment. Starting with a system where one server manages a file of a given s...
Adriano Di Pasquale, Enrico Nardelli
VISUALIZATION
2000
IEEE
14 years 1 months ago
Hardware-accelerated volume and isosurface rendering based on cell-projection
We present two beneficial rendering extensions to the Projected Tetrahedra (PT) algorithm by Shirley and Tuchman. These extensions are compatible with any cell sorting technique,...
Stefan Röttger, Martin Kraus, Thomas Ertl
SIGMETRICS
2008
ACM
13 years 9 months ago
Scheduling despite inexact job-size information
Motivated by the optimality of Shortest Remaining Processing Time (SRPT) for mean response time, in recent years many computer systems have used the heuristic of "favoring sm...
Adam Wierman, Misja Nuyens