10988 search results - page 1828 / 2198 » Algorithmic Folding Complexity |
124
Voted
APPT
2007
Springer
15 years 11 months ago
2007
Springer
We investigate the problem of constructing the maximal number of node disjoint paths between two distinct nodes in Swapped/OTIS networks. A general construction of node disjoint pa...
119
click to vote
ATAL
2007
Springer
15 years 11 months ago
2007
Springer
This paper contributes to solve effectively stochastic resource allocation problems known to be NP-Complete. To address this complex resource management problem, a Qdecomposition...
131
click to vote
ATAL
2007
Springer
15 years 11 months ago
2007
Springer
In this paper, we address the problem of building a system of autonomous agents for a complex environment, in our case, a museum with many visitors. Visitors may have varying pref...
121
click to vote
AUSAI
2007
Springer
15 years 11 months ago
2007
Springer
The traditional concept of a genetic algorithm (GA) is that of selection, crossover and mutation. However, a limited amount of data from the literature has suggested that the nich...
206
click to vote
BIOWIRE
2007
Springer
15 years 11 months ago
2007
Springer
Epidemics-inspired techniques have received huge attention in recent years from the distributed systems and networking communities. These algorithms and protocols rely on probabili...