Sciweavers

467 search results - page 87 / 94
» Acceleration of Shortest Path and Constrained Shortest Path ...
Sort
View
NETGAMES
2006
ACM
14 years 20 days ago
Applicability of group communication for increased scalability in MMOGs
Massive multiplayer online games (MMOGs) are today the driving factor for the development of distributed interactive applications, and they are increasing in size and complexity. ...
Knut-Helge Vik, Carsten Griwodz, Pål Halvors...
FOCS
2005
IEEE
14 years 10 days ago
How to Pay, Come What May: Approximation Algorithms for Demand-Robust Covering Problems
Robust optimization has traditionally focused on uncertainty in data and costs in optimization problems to formulate models whose solutions will be optimal in the worstcase among ...
Kedar Dhamdhere, Vineet Goyal, R. Ravi, Mohit Sing...
WEA
2005
Springer
98views Algorithms» more  WEA 2005»
14 years 5 days ago
Implementing Minimum Cycle Basis Algorithms
Abstract. In this paper we consider the problem of computing a minimum cycle basis of an undirected graph G = (V, E) with n vertices and m edges. We describe an efficient implement...
Kurt Mehlhorn, Dimitrios Michail
CHI
1999
ACM
13 years 11 months ago
Design Guidelines for Landmarks to Support Navigation in Virtual Environments
not abstract asymmetry: different sides looks different clumps different from ”data objects” need grid structure, alignment [Design Guidelines for Landmarks to Support Navigati...
Norman G. Vinson
NETWORKING
2004
13 years 8 months ago
Bounds on Benefits and Harms of Adding Connections to Noncooperative Networks
Abstract. In computer networks (and, say, transportation networks), we can consider the situation where each user has its own routing decision so as to minimize noncooperatively th...
Hisao Kameda