Sciweavers

6105 search results - page 877 / 1221
» A Parallel Algorithm for Bound-Smoothing
Sort
View
RSFDGRC
2005
Springer
151views Data Mining» more  RSFDGRC 2005»
16 years 6 days ago
DIXER - Distributed Executor for Rough Set Exploration System
We present the Distributed Executor for RSES (DIXER) which is a supplementary software for the Rough Set Exploration System (RSES). It takes an advantage of grid computing paradigm...
Jan G. Bazan, Rafal Latkowski, Marcin S. Szczuka
STACS
2005
Springer
16 years 6 days 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
PADS
2004
ACM
16 years 4 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
EUROPAR
2004
Springer
16 years 3 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...
GCC
2004
Springer
16 years 3 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