Sciweavers

948 search results - page 34 / 190
» What can we achieve by arbitrary announcements
Sort
View
MST
2010
93views more  MST 2010»
13 years 6 months ago
Atomic Congestion Games: Fast, Myopic and Concurrent
We study here the effect of concurrent greedy moves of players in atomic congestion games where n selfish agents (players) wish to select a resource each (out of m resources) so ...
Dimitris Fotakis, Alexis C. Kaporis, Paul G. Spira...
ICALP
2009
Springer
14 years 8 months ago
A Distributed and Oblivious Heap
This paper shows how to build and maintain a distributed heap which we call SHELL. In contrast to standard heaps, our heap is oblivious in the sense that its structure only depends...
Christian Scheideler, Stefan Schmid
ACSC
2008
IEEE
14 years 2 months ago
JWS: a flexible web service
Web services have been proposed as means to provide more convenient access to computation services. An issue that still must be dealt with is what to do if there is no web service...
Andrew Cho, Paresh Deva, Ewan D. Tempero
FCCM
2008
IEEE
115views VLSI» more  FCCM 2008»
14 years 2 months ago
Simultaneous Retiming and Placement for Pipelined Netlists
Although pipelining or C-slowing an FPGA-based application can potentially dramatically improve the performance, this poses a question for conventional reconfigurable architecture...
Kenneth Eguro, Scott Hauck
ECAI
2004
Springer
13 years 11 months ago
Goal Specification in Presence of Non-Deterministic Actions
One important aspect in directing cognitive robots or agents is to formally specify what is expected of them. This is often referred to as goal specification. For agents whose act...
Chitta Baral, Jicheng Zhao