15033 search results - page 2666 / 3007 » Complexity Theory and Algorithms |
170
click to vote
ADAEUROPE
2007
Springer
16 years 28 days ago
2007
Springer
When developing concurrent software, a proper engineering practice is to choose a good level of abstraction for expressing concurrency control. Ideally, this level should provide p...
159
click to vote
APPT
2007
Springer
16 years 27 days 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...
159
click to vote
ATAL
2007
Springer
16 years 27 days 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...
177
click to vote
ATAL
2007
Springer
16 years 27 days 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...
151
click to vote
AUSAI
2007
Springer
16 years 27 days 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...