9842 search results - page 205 / 1969 » Problem complexity |
130
click to vote
IPPS
2000
IEEE
15 years 7 months ago
2000
IEEE
Cellular automata can be used to design high-performance natural solvers on parallel computers. This paper describes the development of applications using CARPET, a high-level prog...
110
click to vote
DSN
2006
IEEE
15 years 8 months ago
2006
IEEE
Fault-tolerant time-triggered communication relies on the synchronization of local clocks. The startup problem is the problem of reaching a sufficient degree of synchronization a...
108
click to vote
AH
2004
Springer
15 years 8 months ago
2004
Springer
Abstract. The virtual laboratory (VILAB) supports interactive problem solving in computer science with access to complex software-tools. During the problem solving processes the le...
116
click to vote
VMCAI
2005
Springer
15 years 8 months ago
2005
Springer
When a system fails to satisfy its specification, the model checker produces an error trace (or counter-example) that demonstrates an undesirable behavior, which is then used in d...
141
click to vote
ICICIC
2006
IEEE
15 years 8 months ago
2006
IEEE
Multiple travelling salesman problem (MTSP) is a typical computationally complex combinatorial optimization problem,which is an extension of the famous travelling salesman problem...