Sciweavers

4037 search results - page 195 / 808
» Routing without ordering
Sort
View
IOR
2010
161views more  IOR 2010»
13 years 8 months ago
Mechanism Design for Decentralized Online Machine Scheduling
We study the online version of the classical parallel machine scheduling problem to minimize the total weighted completion time from the perspective of algorithmic mechanism desig...
Birgit Heydenreich, Rudolf Müller, Marc Uetz
ICDE
2011
IEEE
244views Database» more  ICDE 2011»
13 years 2 months ago
Algorithms for local sensor synchronization
— In a wireless sensor network (WSN), each sensor monitors environmental parameters, and reports its readings to a base station, possibly through other nodes. A sensor works in c...
Lixing Wang, Yin Yang, Xin Miao, Dimitris Papadias...
GIS
2006
ACM
13 years 10 months ago
A peer-to-peer spatial cloaking algorithm for anonymous location-based service
This paper tackles a major privacy threat in current location-based services where users have to report their exact locations to the database server in order to obtain their desir...
Chi-Yin Chow, Mohamed F. Mokbel, Xuan Liu
SIGMETRICS
2011
ACM
182views Hardware» more  SIGMETRICS 2011»
13 years 1 months ago
Fine-grained latency and loss measurements in the presence of reordering
Modern trading and cluster applications require microsecond latencies and almost no losses in data centers. This paper introduces an algorithm called FineComb that can estimate ...
Myungjin Lee, Sharon Goldberg, Ramana Rao Kompella...
CEC
2009
IEEE
14 years 5 months ago
Task decomposition and evolvability in intrinsic evolvable hardware
— Many researchers have encountered the problem that the evolution of electronic circuits becomes exponentially more difficult when problems with an increasing number of outputs...
Tüze Kuyucu, Martin Trefzer, Julian Francis M...