Sciweavers

339 search results - page 60 / 68
» Is the Euclidean algorithm optimal among its peers
Sort
View
IEEEPACT
2002
IEEE
14 years 12 days ago
Increasing and Detecting Memory Address Congruence
A static memory reference exhibits a unique property when its dynamic memory addresses are congruent with respect to some non-trivial modulus. Extraction of this congruence inform...
Samuel Larsen, Emmett Witchel, Saman P. Amarasingh...
INFOCOM
1997
IEEE
13 years 11 months ago
Atomic Resource Sharing in Noncooperative Networks
In noncooperative networks, resources are shared among selfish users, which optimize their individual performance measure. We consider the generic and practically important case o...
Lavy Libman, Ariel Orda
SIGECOM
2008
ACM
126views ECommerce» more  SIGECOM 2008»
13 years 7 months ago
Behavioral experiments in networked trade
We report on an extensive series of highly controlled human subject experiments in networked trade. Our point of departure is a simple and well-studied bipartite network exchange ...
J. Stephen Judd, Michael Kearns
TITB
2008
117views more  TITB 2008»
13 years 7 months ago
Image-Based Gating of Intravascular Ultrasound Pullback Sequences
Intravascularultrasound (IVUS) sequences recorded in vivo are subject to a wide array of motion artifacts as the majority of these studies are performed within the coronary arterie...
Sean M. O'Malley, J. F. Granada, Stephane G. Carli...
WINE
2010
Springer
154views Economy» more  WINE 2010»
13 years 5 months ago
The Good, The Bad and The Cautious: Safety Level Cooperative Games
Abstract. We study safety level coalitions in competitive games. Given a normal form game, we define a corresponding cooperative game with transferable utility, where the value of ...
Yoram Bachrach, Maria Polukarov, Nicholas R. Jenni...