Sciweavers

844 search results - page 55 / 169
» Further results on concordance relations
Sort
View
APWEB
2004
Springer
15 years 4 months ago
Improving XML Query Performance Using Social Classes
In a state-of-the-art XML database, an XML query is evaluated as a sequence of structural joins in which positions of data nodes are used to perform each individual structural joi...
Weining Zhang, Douglas Pollok
WDAG
2004
Springer
103views Algorithms» more  WDAG 2004»
15 years 4 months ago
Relationships Between Broadcast and Shared Memory in Reliable Anonymous Distributed Systems
We study the power of reliable anonymous distributed systems, where processes do not fail, do not have identifiers, and run identical programmes. We are interested specifically i...
James Aspnes, Faith Ellen Fich, Eric Ruppert
FSTTCS
2001
Springer
15 years 3 months ago
Semidefinite Programming Based Approximation Algorithms
Semidefinite programming based approximation algorithms, such as the Goemans and Williamson approximation algorithm for the MAX CUT problem, are usually shown to have certain perf...
Uri Zwick
IJMMS
2006
93views more  IJMMS 2006»
14 years 11 months ago
Presence, workload and performance effects of synthetic environment design factors
There remains a limited understanding of factors in presence and its relation to performance. This research examined a range of synthetic environment (SE) design features (viewpoi...
Ruiqi Ma, David B. Kaber
TEC
2002
117views more  TEC 2002»
14 years 11 months ago
A genetic algorithm for shortest path routing problem and the sizing of populations
This paper presents a genetic algorithmic approach to the shortest path (SP) routing problem. Variable-length chromosomes (strings) and their genes (parameters) have been used for ...
Chang Wook Ahn, Rudrapatna S. Ramakrishna