ICS 2010 - PDF Preprint Papers

ICS 2010 International Conference on Supercomputing

Teaser Browsing | Click Here

Title Browsing | Click Here

Wall of Fame | Most Viewed ICS-2010 Paper

click to vote

ICS
2010
Tsinghua U.

202views Distributed And Parallel Com...» more ICS 2010»

A New Look at Selfish Routing

1 years 11 months ago

Download www.eecs.berkeley.edu

: 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

claim paper

Read More »

Disclaimer and Copyright Notice

Sciweavers respects the rights of all copyright holders and in this regard, authors are only allowed to share a link to their preprint paper on their own website. Every contribution is associated with a desciptive image. It is the sole responsibility of the authors to ensure that their posted image is not copyright infringing. This service is compliant with IEEE copyright.

Id	Views	Title	Status
1	202	A New Look at Selfish Routing	claim
2	188	Market Equilibrium under Separable, Piecewise-Linear, Concave Utilities	claim
3	178	Robustness of the Learning with Errors Assumption	claim
4	132	Local Algorithms for Finding Interesting Individuals in Large Networks	claim
5	122	A query language for understanding component interactions in production systems	claim
6	109	Overlapping communication and computation by using a hybrid MPI/SMPSs approach	claim
7	103	A New Approach to Strongly Polynomial Linear Programming	claim
8	86	Large-scale FFT on GPU clusters	claim
9	78	Weight Distribution and List-Decoding Size of Reed-Muller Codes	claim
10	78	Small-ruleset regular expression matching on GPGPUs: quantitative performance analysis and optimization	claim
11	77	Cryptographic Complexity Classes and Computational Intractability Assumptions	claim
12	77	On the Power of a Unique Quantum Witness	claim
13	76	Global Alignment of Molecular Sequences via Ancestral State Reconstruction	claim
14	75	Reaching Consensus on Social Networks	claim
15	74	A New Approximation Technique for Resource-Allocation Problems	claim
16	73	Computational Complexity and Information Asymmetry in Financial Products (Extended Abstract)	claim
17	72	Distribution-Specific Agnostic Boosting	claim
18	71	Playing Games without Observing Payoffs	claim
19	71	Handling task dependencies under strided and aliased references	claim
20	70	Circumventing the Price of Anarchy: Leading Dynamics to Good Behavior	claim
21	70	Effectively Polynomial Simulations	claim
22	69	Circuit Lower Bounds, Help Functions, and the Remote Point Problem	claim
23	68	Cache oblivious parallelograms in iterative stencil computations	claim
24	68	Streamlining GPU applications on the fly: thread divergence elimination through runtime thread-data remapping	claim
25	66	Cryptography by Cellular Automata or How Fast Can Complexity Emerge in Nature?	claim
26	65	Non-Malleable Codes	claim
27	64	Beyond Equilibria: Mechanisms for Repeated Combinatorial Auctions	claim
28	64	Derandomizing Algorithms on Product Distributions and Other Applications of Order-Based Extraction	claim
29	63	Breaking and Making Quantum Money: Toward a New Quantum Cryptographic Protocol	claim
30	63	Analytical Tools for Natural Algorithms	claim
31	63	Interactive Proofs For Quantum Computations	claim
32	63	Cache Replacement Policies for Multicore Processors	claim
33	61	Adversarial Leakage in Games	claim
34	61	Space-Efficient Estimation of Robust Statistics and Distribution Testing	claim
35	61	Are Stable Instances Easy?	claim
36	60	Hard Instances for Satisfiability and Quasi-one-way Functions	claim
37	60	Clustering performance data efficiently at massive scales	claim
38	60	Speeding up Nek5000 with autotuning and specialization	claim
39	60	The auction: optimizing banks usage in Non-Uniform Cache Architectures	claim
40	59	Memory Consistency Conditions for Self-Assembly Programming	claim
41	59	Robustly Leveraging Collusion in Combinatorial Auctions	claim
42	59	Proof-Carrying Data and Hearsay Arguments from Signature Cards	claim
43	58	InterferenceRemoval: removing interference of disk access for MPI programs through data replication	claim
44	57	Pan-Private Streaming Algorithms	claim
45	56	Symmetric LDPC Codes and Local Testing	claim
46	55	Bounds on the Quantum Satisfiability Threshold	claim
47	55	Bounding Rationality by Discounting Time	claim
48	55	On the Construction of One-Way Functions from Average Case Hardness	claim
49	55	Quantifying performance benefits of overlap using MPI-2 in a seismic modeling application	claim
50	54	ParaLearn: a massively parallel, scalable system for learning interaction networks on FPGAs	claim
51	54	Timing local streams: improving timeliness in data prefetching	claim
52	52	Compiler and runtime support for enabling generalized reduction computations on heterogeneous parallel configurations	claim
53	51	Robust Perfect Revenue From Perfectly Informed Players	claim
54	51	Game Theory with Costly Computation: Formulation and Application to Protocol Security	claim
55	51	High-throughput Bayesian network learning using heterogeneous multicore computers	claim
56	51	Decomposable and responsive power models for multicore processors using performance counters	claim
57	46	An approach to resource-aware co-scheduling for CMPs	claim
58	44	Making nested parallel transactions practical using lightweight hardware support	claim

Sciweavers

Explore & Download

Productivity Tools

Document Tools

Image Tools

Sciweavers