Sciweavers

672 search results - page 45 / 135
» Almost Optimal Dispersers
Sort
View
RTS
2010
121views more  RTS 2010»
13 years 8 months ago
A compiler framework for the reduction of worst-case execution times
The current practice to design software for real-time systems is tedious. There is almost no tool support that assists the designer in automatically deriving safe bounds of the wor...
Heiko Falk, Paul Lokuciejewski
SIGMOD
2012
ACM
202views Database» more  SIGMOD 2012»
12 years 3 days ago
MCJoin: a memory-constrained join for column-store main-memory databases
There exists a need for high performance, read-only mainmemory database systems for OLAP-style application scenarios. Most of the existing works in this area are centered around t...
Steven Keith Begley, Zhen He, Yi-Ping Phoebe Chen
GECCO
2007
Springer
137views Optimization» more  GECCO 2007»
14 years 3 months ago
Robust multi-cellular developmental design
This paper introduces a continuous model for Multi-cellular Developmental Design. The cells are fixed on a 2D grid and exchange ”chemicals” with their neighbors during the gr...
Alexandre Devert, Nicolas Bredeche, Marc Schoenaue...
INFOCOM
2002
IEEE
14 years 2 months ago
Gossip-based ad hoc routing
— Many ad hoc routing protocols are based on (some variant of) flooding. Despite various optimizations, many routing messages are propagated unnecessarily. We propose a gossipin...
Zygmunt J. Haas, Joseph Y. Halpern, Erran L. Li
SIAMCOMP
2010
104views more  SIAMCOMP 2010»
13 years 4 months ago
Server Scheduling to Balance Priorities, Fairness, and Average Quality of Service
Often server systems do not implement the best known algorithms for optimizing average Quality of Service (QoS) out of concern of that these algorithms may be insufficiently fair ...
Nikhil Bansal, Kirk Pruhs