Sciweavers

3991 search results - page 630 / 799
» Bounding homogeneous models
Sort
View
DSD
2009
IEEE
144views Hardware» more  DSD 2009»
14 years 2 months ago
Composable Resource Sharing Based on Latency-Rate Servers
Abstract—Verification of application requirements is becoming a bottleneck in system-on-chip design, as the number of applications grows. Traditionally, the verification comple...
Benny Akesson, Andreas Hansson, Kees Goossens
FOCS
2009
IEEE
14 years 2 months ago
Instance-Optimal Geometric Algorithms
We prove the existence of an algorithm A for computing 2-d or 3-d convex hulls that is optimal for every point set in the following sense: for every set S of n points and for ever...
Peyman Afshani, Jérémy Barbay, Timot...
GLOBECOM
2009
IEEE
14 years 2 months ago
Random Linear Network Coding for Time-Division Duplexing: Field Size Considerations
Abstract— We study the effect of the field size on the performance of random linear network coding for time division duplexing channels proposed in [1]. In particular, we study ...
Daniel Enrique Lucani, Muriel Médard, Milic...
ATAL
2009
Springer
14 years 2 months ago
The price of democracy in coalition formation
Whenever rational agents form coalitions to execute tasks, doing so via a decentralized negotiation process—while more robust and democratic—may lead to a loss of efficiency ...
Georgios Chalkiadakis, Edith Elkind, Maria Polukar...
ISAAC
2009
Springer
140views Algorithms» more  ISAAC 2009»
14 years 2 months ago
Shifting Strategy for Geometric Graphs without Geometry
We give a simple framework which is an alternative to the celebrated and widely used shifting strategy of Hochbaum and Maass [J. ACM, 1985] which has yielded efficient algorithms ...
Imran A. Pirwani