Sciweavers

3367 search results - page 556 / 674
» Incremental assignment problem
Sort
View
WDAG
2005
Springer
67views Algorithms» more  WDAG 2005»
15 years 8 months ago
What Can Be Implemented Anonymously?
Abstract. The vast majority of papers on distributed computing assume that processes are assigned unique identifiers before computation begins. But is this assumption necessary? W...
Rachid Guerraoui, Eric Ruppert
GECCO
2005
Springer
150views Optimization» more  GECCO 2005»
15 years 8 months ago
A GA for maximum likelihood phylogenetic inference using neighbour-joining as a genotype to phenotype mapping
Evolutionary relationships among species can be represented by a phylogenetic tree and inferred by optimising some measure of fitness, such as the statistical likelihood of the t...
Leon Poladian
ICA3PP
2005
Springer
15 years 8 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,...
ESA
2004
Springer
132views Algorithms» more  ESA 2004»
15 years 8 months ago
Seeking a Vertex of the Planar Matching Polytope in NC
For planar graphs, counting the number of perfect matchings (and hence determining whether there exists a perfect matching) can be done in NC [4, 10]. For planar bipartite graphs, ...
Raghav Kulkarni, Meena Mahajan
GI
2004
Springer
15 years 8 months ago
Type Safe Programming of XML-based Applications
: There is an emerging amount of software for generating and manipulating XML documents. This paper addresses the problem of guaranteeing the validity of dynamically generated XML ...
Martin Kempa, Volker Linnemann