5832 search results - page 241 / 1167 » Software complexity and maintainability |
116
click to vote
WSC
1998
15 years 6 months ago
1998
The increasing use of discrete simulation in modelling large and complex systems brings new challenges. One such challenge is the need to devise ways of developing modular approac...
136
Voted
AIPS
2009
15 years 5 months ago
2009
The ability to automatically compose Web Services is critical for realising more complex functionalities. Several proposals to use automated planning to deal with the problem of s...
125
click to vote
ENTCS
2008
15 years 4 months ago
2008
Using linear algebraic techniques, we analyse the computational complexity of testing reachability in Petri nets for which markings can grow very fast. This leads to two subclasse...
130
click to vote
TSP
2008
15 years 4 months ago
2008
In this paper, we present a near ML-achieving sphere decoding algorithm that reduces the number of search operations in the sphere-constrained search. Specifically, by adding a pro...
149
click to vote
ICCSA
2010
Springer
15 years 1 months ago
2010
Springer
Recently, it is one of the most challenging fields in software engineering for embedded software development, since the advancement of embedded technologies has made our life incre...