Sciweavers

373 search results - page 48 / 75
» Two Attacks on Reduced IDEA
Sort
View
IJSWIS
2006
83views more  IJSWIS 2006»
14 years 9 months ago
Semantic Enrichment in Ontologies for Matching
Ontology matching (or mapping)--finding correspondences between semantically related entities of heterogeneous ontologies--becomes crucial for interoperability in distributed and ...
Nwe Ni Tun, Satoshi Tojo
CDC
2010
IEEE
130views Control Systems» more  CDC 2010»
14 years 4 months ago
Decomposability of global tasks for multi-agent systems
Abstract-- Multi-agent system is a rapidly developing research area with strong support from both civilian and military applications. One of the essential problems in multi-agent s...
Mohammad Karimadini, Hai Lin 0002
ICA3PP
2005
Springer
15 years 3 months ago
Data Distribution Strategies for Domain Decomposition Applications in Grid Environments
Abstract. In this paper, we evaluate message-passing applications in Grid environments using domain decomposition technique. We compare two domain decomposition strategies: a balan...
Beatriz Otero, José M. Cela, Rosa M. Badia,...
MM
2010
ACM
186views Multimedia» more  MM 2010»
14 years 10 months ago
Hybrid load balancing for online games
As massively multiplayer online games are becoming very popular, how to support a large number of concurrent users while maintaining the game performance has become an important r...
Rynson W. H. Lau
COMBINATORICA
2007
148views more  COMBINATORICA 2007»
14 years 9 months ago
Colored graphs without colorful cycles
A colored graph is a complete graph in which a color has been assigned to each edge, and a colorful cycle is a cycle in which each edge has a different color. We first show that ...
Richard N. Ball, Ales Pultr, Petr Vojtechovsk&yacu...