Sciweavers

6437 search results - page 906 / 1288
» Parallel Algorithms for Arrangements
Sort
View
STACS
2005
Springer
16 years 1 months ago
Worst-Case and Average-Case Approximations by Simple Randomized Search Heuristics
Abstract. In recent years, probabilistic analyses of algorithms have received increasing attention. Despite results on the average-case complexity and smoothed complexity of exact ...
Carsten Witt
191
Voted
PADS
2004
ACM
16 years 28 days ago
Time Warp -- Connection Oriented
: Time warp is a well-known optimistic mechanism for parallel execution of simulation programs. Implementing time warp using a connection-oriented communication approach is propose...
Nasser Kalantery
214
Voted
EUROPAR
2004
Springer
16 years 27 days ago
Near-Optimal Hot-Potato Routing on Trees
In hot-potato (deflection) routing, nodes in the network have no buffers for packets in transit, so that some conflicting packets must be deflected away from their destination...
Costas Busch, Malik Magdon-Ismail, Marios Mavronic...
179
Voted
GCC
2004
Springer
16 years 27 days ago
Maintaining Comprehensive Resource Availability in P2P Networks
Abstract. In this paper, the resource availability issue has been addressed with respect to the intermittent connectivity and dynamic presence of peers in a P2P system. We aim to m...
Bin Xiao, Jiannong Cao, Edwin Hsing-Mean Sha
NPC
2004
Springer
16 years 26 days ago
Request Distribution for Fairness with a New Load-Update Mechanism in Web Server Cluster
The complexity of services and applications provided by Web sites is ever increasing as integration of traditional Web publishing sites with new paradigms, i.e., e-commerce. Each d...
MinHwan Ok, Myong-Soon Park