Sciweavers

356 search results - page 66 / 72
» Parallelizing time with polynomial circuits
Sort
View
IPPS
1998
IEEE
14 years 4 days ago
Partial Rearrangements of Space-Shared FPGAs
Abstract Oliver Diessel1 and Hossam ElGindy2 1Department of Computer Science and Software Engineering 2Department of Electrical and Computer Engineering The University of Newcastle...
Oliver Diessel, Hossam A. ElGindy
ATAL
2009
Springer
14 years 2 months ago
An analysis of feasible solutions for multi-issue negotiation involving nonlinear utility functions
This paper analyzes bilateral multi-issue negotiation between selfinterested agents. Specifically, we consider the case where issues are divisible, there are time constraints in ...
S. Shaheen Fatima, Michael Wooldridge, Nicholas R....
IOR
2010
161views more  IOR 2010»
13 years 6 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
SPAA
2009
ACM
14 years 8 months ago
Brief announcement: parameterized maximum and average degree approximation in topic-based publish-subscribe overlay network desi
Designing an overlay network for publish/subscribe communication in a system where nodes may subscribe to many different topics of interest is of fundamental importance. For scala...
Melih Onus, Andréa W. Richa
STOC
2002
ACM
111views Algorithms» more  STOC 2002»
14 years 8 months ago
The price of anarchy is independent of the network topology
We study the degradation in network performance caused by the selfish behavior of noncooperative network users. We consider a model of selfish routing in which the latency experie...
Tim Roughgarden