Sciweavers

206 search results - page 40 / 42
» Better Bounds for Online Scheduling
Sort
View
SIGUCCS
2006
ACM
14 years 1 months ago
We got the message: creating an instant messenger service point
Figuring out the best way to communicate with and serve students is one of the paramount challenges facing library and technology organizations today, including Bucknell Universit...
Jason Snyder, Meredith Field
EDBT
2009
ACM
156views Database» more  EDBT 2009»
13 years 11 months ago
Efficient skyline retrieval with arbitrary similarity measures
A skyline query returns a set of objects that are not dominated by other objects. An object is said to dominate another if it is closer to the query than the latter on all factors...
Deepak P, Prasad M. Deshpande, Debapriyo Majumdar,...
JSA
2007
191views more  JSA 2007»
13 years 7 months ago
Automated memory-aware application distribution for Multi-processor System-on-Chips
Mapping of applications on a Multiprocessor System-on-Chip (MP-SoC) is a crucial step to optimize performance, energy and memory constraints at the same time. The problem is formu...
Heikki Orsila, Tero Kangas, Erno Salminen, Timo D....
INFOCOM
2010
IEEE
13 years 6 months ago
Opportunistic Routing in Multi-radio Multi-channel Multi-hop Wireless Networks
— Two major factors that limit the throughput in multi-hop wireless networks are the unreliability of wireless transmissions and co-channel interference. One promising technique ...
Kai Zeng, Zhenyu Yang, Wenjing Lou
VLDB
2004
ACM
126views Database» more  VLDB 2004»
14 years 26 days ago
STEPS towards Cache-resident Transaction Processing
Online transaction processing (OLTP) is a multibillion dollar industry with high-end database servers employing state-of-the-art processors to maximize performance. Unfortunately,...
Stavros Harizopoulos, Anastassia Ailamaki