Result 1 to 20 of 301 total
Approximation-based tree regular model-checking. (English)
Nord. J. Comput. 14, No. 3, 216-241 (2009).
1
Tracking mobile users in cellular networks using timing information. (English)
Nord. J. Comput. 14, No. 3, 202-215 (2009).
2
Formalising scheduling theories in duration calculus. (English)
Nord. J. Comput. 14, No. 3, 173-201 (2009).
3
On the complexity of variations of equal sum subsets. (English)
Nord. J. Comput. 14, No. 3, 151-172 (2009).
4
Pattern-based genetic model refinements in MDA. (English)
Nord. J. Comput. 14, No. 4, 338-355 (2008).
5
Featback: method for enhancing management of agile development. (English)
Nord. J. Comput. 14, No. 4, 321-337 (2008).
6
A metamodel and supporting process and tool for specifying quality models in model-based software development. (English)
Nord. J. Comput. 14, No. 4, 301-320 (2008).
7
Estimation of real-time software component size. (English)
Nord. J. Comput. 14, No. 4, 282-300 (2008).
8
A model-based approach to reflective command interfaces. (English)
Nord. J. Comput. 14, No. 4, 264-281 (2008).
9
Service engineering with the sims design and validation tools. (English)
Nord. J. Comput. 14, No. 4, 245-263 (2008).
10
Block sorting: a characterization and some heuristics. (English)
Nord. J. Comput. 14, No. 1-2, 126-150 (2007).
11
Path layout on tree networks: bounds in different label switching models. (English)
Nord. J. Comput. 14, No. 1-2, 109-125 (2007).
12
Linear-time certifying recognition algorithms and forbidden induced subgraphs. (English)
Nord. J. Comput. 14, No. 1-2, 87-108 (2007).
13
Formal specification and analysis of hardware systems in timed Chi. (English)
Nord. J. Comput. 14, No. 1-2, 65-86 (2007).
14
A formalism for reasoning about UML activity diagrams. (English)
Nord. J. Comput. 14, No. 1-2, 43-64 (2007).
15
Using forward reachability analysis for verification of timed Petri nets. (English)
Nord. J. Comput. 14, No. 1-2, 1-42 (2007).
16
A simplified derivation of timing complexity lower bounds for sorting by comparisons. (English)
Nord. J. Comput. 13, No. 4, 340-346 (2006).
17
Streaming maximum-minimum filter using no more than three comparisons per element. (English)
Nord. J. Comput. 13, No. 4, 328-339 (2006).
18
Chain programming over difference constraints. (English)
Nord. J. Comput. 13, No. 4, 309-327 (2006).
19
Range-aggregate query problems involving geometric aggregation operations. (English)
Nord. J. Comput. 13, No. 4, 294-308 (2006).
20
Result 1 to 20 of 301 total
Start
Contact
Print
General Help
