5228 search results - page 684 / 1046 » Case Studies for Software Engineers |
166
click to vote
FSTTCS
2005
Springer
16 years 12 days ago
2005
Springer
We investigate the s-t-connectivity problem for directed planar graphs, which is hard for L and is contained in NL but is not known to be complete. We show that this problem is log...
200
click to vote
ARCS
2004
Springer
16 years 8 days ago
2004
Springer
: This paper addresses the optimization of a dynamic Traveling Salesman Problem using the Ant Colony Optimization algorithm. Ants are social insects with limited skills that live i...
159
click to vote
MSR
2010
ACM
15 years 12 months ago
2010
ACM
—The severity of a reported bug is a critical factor in deciding how soon it needs to be fixed. Unfortunately, while clear guidelines exist on how to assign the severity of a bu...
214
click to vote
I3E
2001
15 years 8 months ago
2001
: Designing security-critical systems correctly is very difficult. We present work on software engineering of security critical systems, supported by the CASE tool AUTOFOCUS. Secur...
180
click to vote
SIGCSE
2008
ACM
15 years 6 months ago
2008
ACM
Providing consistent, instant, and detailed feedback to students has been a big challenge in teaching Web based computing, given the complexity of project assignments and the comp...