Sciweavers

5448 search results - page 281 / 1090
» Breakpoints and Time in Distributed Computations
Sort
View
CIA
2006
Springer
15 years 10 months ago
Egalitarian Allocations of Indivisible Resources: Theory and Computation
We present a mechanism for collaboration and coordination amongst agents in multi-agent societies seeking social equity. This mechanism allows to compute egalitarian allocations of...
Paul-Amaury Matt, Francesca Toni
DATE
2010
IEEE
154views Hardware» more  DATE 2010»
15 years 7 months ago
Computing robustness of FlexRay schedules to uncertainties in design parameters
Abstract--In the current environment of rapidly changing invehicle requirements and ever-increasing functional content for automotive EE systems, there are several sources of uncer...
Arkadeb Ghosal, Haibo Zeng, Marco Di Natale, Yakov...
CONCURRENCY
1998
130views more  CONCURRENCY 1998»
15 years 6 months ago
JPVM: network parallel computing in Java
The JPVM library is a software system for explicit message-passing based distributed memory MIMD parallel programming in Java. The library supports an interface similar to the C a...
Adam Ferrari
EDBT
2008
ACM
161views Database» more  EDBT 2008»
16 years 6 months ago
Load distribution of analytical query workloads for database cluster architectures
Enterprises may have multiple database systems spread across the organization for redundancy or for serving different applications. In such systems, query workloads can be distrib...
Thomas Phan, Wen-Syan Li
INFOCOM
2008
IEEE
16 years 1 months ago
Approximation Algorithms for Computing Capacity of Wireless Networks with SINR Constraints
—A fundamental problem in wireless networks is to estimate its throughput capacity - given a set of wireless nodes, and a set of connections, what is the maximum rate at which da...
Deepti Chafekar, V. S. Anil Kumar, Madhav V. Marat...