Sciweavers

2165 search results - page 348 / 433
» cases 2005
Sort
View
ESA
2005
Springer
135views Algorithms» more  ESA 2005»
15 years 11 months ago
Approximation Complexity of min-max (Regret) Versions of Shortest Path, Spanning Tree, and Knapsack
This paper investigates, for the first time in the literature, the approximation of min-max (regret) versions of classical problems like shortest path, minimum spanning tree, and ...
Hassene Aissi, Cristina Bazgan, Daniel Vanderpoote...
GECCO
2005
Springer
150views Optimization» more  GECCO 2005»
15 years 11 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 11 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,...
ICICS
2005
Springer
15 years 11 months ago
Network Vulnerability Analysis Through Vulnerability Take-Grant Model (VTG)
Modeling and analysis of information system vulnerabilities helps us to predict possible attacks to networks using the network configuration and vulnerabilities information. As a f...
Hamid Reza Shahriari, Reza Sadoddin, Rasool Jalili...
ALGOSENSORS
2004
Springer
15 years 11 months ago
The Expected Uncertainty of Range Free Localization Protocols in Sensor Networks
We consider three range-free localization protocols for sensor networks and analyze their accuracy in terms of the expected area of uncertainty of position per sensor. Assuming a ...
Gideon Stupp, Moshe Sidi