Sciweavers

3192 search results - page 107 / 639
» The minimum latency problem
Sort
View
119
Voted
ICS
2010
Tsinghua U.
16 years 1 months ago
A New Look at Selfish Routing
: We revisit price of anarchy in network routing, in a new model in which routing decisions are made by self-interested components of the network, as opposed to by the flows as in ...
Christos Papadimitriou, Gregory Valiant
WMPI
2004
ACM
15 years 9 months ago
Evaluating kilo-instruction multiprocessors
The ever increasing gap in processor and memory speeds has a very negative impact on performance. One possible solution to overcome this problem is the Kilo-instruction processor. ...
Marco Galluzzi, Ramón Beivide, Valentin Pue...
129
Voted
EUROPAR
1997
Springer
15 years 8 months ago
Prefetching and Multithreading Performance in Bus-Based Multiprocessors with Petri Nets
The large latency of memory accesses is a major obstacle in obtaining high processor utilization in large scale shared-memory multiprocessors. Access to remote memory is likely to ...
Edward D. Moreno, Sergio Takeo Kofuji, Marcelo H. ...
115
Voted
EDUTAINMENT
2006
Springer
15 years 7 months ago
Efficiently Maintaining Consistency Using Tree-Based P2P Network System in Distributed Network Games
There are two main approaches, conservative and optimistic, for maintaining consistency in distributed network games. Under the conservative approach, players may experience netwo...
Kyung Seob Moon, Vallipuram Muthukkumarasamy, Anne...
FOCS
1999
IEEE
15 years 8 months ago
Hardness of Approximating the Minimum Distance of a Linear Code
We show that the minimum distance of a linear code is not approximable to within any constant factor in random polynomial time (RP), unless nondeterministic polynomial time (NP) eq...
Ilya Dumer, Daniele Micciancio, Madhu Sudan