Sciweavers

9176 search results - page 367 / 1836
» algorithms 2010
Sort
View
ENTCS
2002
106views more  ENTCS 2002»
15 years 6 months ago
Refactoring by Transformation
In this paper we present how refactoring of object-oriented programs can be accomplished by using refinement. Our approach is based on algebraic laws of an object-oriented languag...
Márcio Cornélio, Ana Cavalcanti, Aug...
ICALP
2010
Springer
15 years 8 months ago
Efficient Evaluation of Nondeterministic Automata Using Factorization Forests
In the first part of the paper, we propose an algorithm which inputs an NFA A and a word a1
Mikolaj Bojanczyk, Pawel Parys
CORR
2010
Springer
141views Education» more  CORR 2010»
15 years 6 months ago
On generalized Frame-Stewart numbers
For the multi-peg Tower of Hanoi problem with k 4 pegs, so far the best solution is obtained by the Stewart's algorithm [15] based on the the following recurrence relation: ...
Jonathan Chappelon, Akihiro Matsuura
ECR
2002
165views more  ECR 2002»
15 years 6 months ago
A Delay-Constrained Least-Cost Multicast Routing Heuristic for Dynamic Multicast Groups
Many new multimedia applications involve dynamic multiple participants, have stringent endto-end delay requirement and consume large amount of network resources. In this paper, we...
Zhengying Wang, Bingxin Shi, Ling Zou
SOCIALCOM
2010
15 years 4 months ago
Measuring Similarity between Sets of Overlapping Clusters
The typical task of unsupervised learning is to organize data, for example into clusters, typically disjoint clusters (eg. the K-means algorithm). One would expect (for example) a...
Mark K. Goldberg, Mykola Hayvanovych, Malik Magdon...