Sciweavers

358 search results - page 13 / 72
» On the Distributed Complexity of Computing Maximal Matchings
Sort
View
CCGRID
2007
IEEE
15 years 5 months ago
A Hybrid Linear Programming and Evolutionary Algorithm based Approach for On-line Resource Matching in Grid Environments
We describe a hybrid linear programming (LP) and evolutionary algorithm (EA) based resource matcher suitable for heterogeneous grid environments. The hybrid matcher adopts the ite...
Pawel Garbacki, Vijay K. Naik
CGF
2011
14 years 5 months ago
Intrinsic Shape Matching by Planned Landmark Sampling
Recently, the problem of intrinsic shape matching has received a lot of attention. A number of algorithms have been proposed, among which random-sampling-based techniques have bee...
Art Tevs, Alexander Berner, Michael Wand, Ivo Ihrk...
IPPS
2007
IEEE
15 years 8 months ago
Table-lookup based Crossbar Arbitration for Minimal-Routed, 2D Mesh and Torus Networks
Crossbar arbitration—which determines the allocation of output ports to packets in the input queues—is a performance-critical stage in the overall performance of routers for i...
Daeho Seo, Mithuna Thottethodi
132
Voted
MIDDLEWARE
2005
Springer
15 years 7 months ago
MEDYM: Match-Early with Dynamic Multicast for Content-Based Publish-Subscribe Networks
Abstract. Design of distributed architectures for content-based publish-subscribe (pub-sub) service networks has been a challenging problem. To best support the highly dynamic and ...
Fengyun Cao, Jaswinder Pal Singh
74
Voted
IPPS
2006
IEEE
15 years 8 months ago
Sim-X: parallel system software for interactive multi-experiment computational studies
Advances in high-performance computing have led to the broad use of computational studies in everyday engineering and scientific applications. A single study may require thousand...
Siu-Man Yau, Eitan Grinspun, Vijay Karamcheti, Den...