Sciweavers

12825 search results - page 164 / 2565
» Improved PLSOM algorithm
Sort
View
ICIAP
1999
ACM
15 years 9 months ago
Improved Low Complexity Fully Parallel Thinning Algorithm
A fully parallel iterative thinning algorithm called MB2 is presented. It favourably competes with the best known algorithms regarding homotopy, mediality; thickness, rotation inv...
Thierry M. Bernard, Antoine Manzanera
AIPS
2010
15 years 7 months ago
Action Elimination and Plan Neighborhood Graph Search: Two Algorithms for Plan Improvement
Compared to optimal planners, satisficing planners can solve much harder problems but may produce overly costly and long plans. Plan quality for satisficing planners has become in...
Hootan Nakhost, Martin Müller 0003
113
Voted
CPE
1998
Springer
81views Hardware» more  CPE 1998»
15 years 9 months ago
Experiments with Improved Approximate Mean Value Analysis Algorithms
Abstract. Approximate Mean Value Analysis (MVA) is a popular technique for analyzing queueing networks because of the efficiency and accuracy that it affords. In this paper, we pre...
Hai Wang, Kenneth C. Sevcik
CCCG
2010
15 years 6 months ago
A new algorithm and improved lower bound for point placement on a line in two rounds
In this paper we show how to construct in 2 rounds a line-rigid point placement graph of size 4n/3+O(1) from small graphs called 6:6 jewels, an extension of the 4:4 jewel of [3]. ...
Md. Shafiul Alam, Asish Mukhopadhyay
154
Voted
HM
2010
Springer
146views Optimization» more  HM 2010»
15 years 5 months ago
An Improved Memetic Algorithm for Break Scheduling
In this paper we consider solving a complex real life break scheduling problem. This problem of high practical relevance arises in many working areas, e.g. in air traffic control a...
Magdalena Widl, Nysret Musliu