Rank: 3749 based on 26 downloads (last 30 days) and 3 files submitted
photo

Roberto Olmi

E-mail
Company/University
Elettric80 S.p.A. - www.elettric80.it
Lat/Long
44.729645, 10.5422

Personal Profile:

PhD, Eng.
See my Curriculum Vitae (Italian):
https://sites.google.com/site/robertoolmi/curriculum-vitae


 

Watch this Author's files

 

Files Posted by Roberto Olmi View all
Updated   File Tags Downloads
(last 30 days)
Comments Rating
15 Apr 2011 Binary Search of Elements lying within an Interval Search all elements (in a sorted vector of n elem.) that lie within an interval. It runs in log(n). Author: Roberto Olmi binary search, interval search, search, matching, search with tolerance 5 2
  • 5.0
5.0 | 2 ratings
23 Oct 2010 Screenshot Heuristic Algorithm for finding Maximum Independent Set Outputs the independent set of maximum cardinality. Runs in O(n^2) time, n=graph size. Author: Roberto Olmi independent set, vertex cover, clique, heuristic, greedy, graph 16 0
  • 5.0
5.0 | 1 rating
04 Sep 2008 2D minimal segments distance Computes the minimal distace between two segments Author: Roberto Olmi measurements, distance, segments, segment, euclidean, 2d 5 0
Comments and Ratings by Roberto Olmi View all
Updated File Comments Rating
16 Nov 2011 dijsktra path finder Mex implementation of the dijkstra algorithm Author: Sebastien PARIS

Hi S├ębastien,
I think that in order to fix this bug you have to initialize parent[i] to -1:
for (i = 0 ; i < n ; i++)
{ distance[i] = inf;
parent[i] = -1; //instead of = 0
visited[i] = 0;
}
and then modify the check you do before backtracking to:
if(parent[s] != -1) //instead of != 0
{...

I've tested it and solves at least my problem...

Regards.

Roberto Olmi

PS: In the code you use the "s" variable to represent the destination node and the "d" to represent the source. This is slightly confusing...

16 Nov 2011 dijsktra path finder Mex implementation of the dijkstra algorithm Author: Sebastien PARIS

Useful tool, thanks.
However a with this code (see below) the the function dinds correcly only the cost of the path but not the path.
Any suggestions?
Thanks

Roberto Olmi

I=[2,11,1,3,2,17,19,26,4,5,6,...
7,8,9,1,10,11,12,13,14,20,15,...
22,3,18,17,4,16,23,15,21,20,...
16,24,19,25,22,23,4];
J=[1,1,2,2,3,3,4,4,5,6,7,8,9,...
10,11,11,12,13,14,15,15,...
16,16,17,17,18,19,19,19,20,...
20,21,22,22,23,23,24,25,26];
V=[1.6000,6.0000,2.6667,1.6000,...
2.6667,1.2000,7.2240,4.2000,...
3.6000,3.2000,3.2000,2.6000,...
2.8000,2.6000,3.6000,7.2240,...
2.4000,3.2000,2.6000,3.0000,...
2.9120,2.0000,2.7120,2.0000,...
1.2000,2.0000,7.2240,4.8000,...
2.7120,4.8533,0.4000,0.6667,...
4.5200,0.4000,4.5200,0.4000,...
0.6667,0.6667,7.0000];
pcost=sparse(I,J,V,length(I),length(I));

pcost(2,1) %check edge 1
pcost(1,11) %check edge 2
pcost(11,12) %check edge 3
[path cost]=dijkstra(pcost,2,12) %search the path 2-1-11-12
%the cost is found correctly but not the path

10 Nov 2010 LAPJV - Jonker-Volgenant Algorithm for Linear Assignment Problem V3.0 A Matlab implementation of the Jonker-Volgenant algorithm solving LAPs. Author: Yi Cao

I've noticed a little bug for scalar input Inf ( lapjv(inf) ). The error occurs at line 85.

10 Nov 2010 LAPJV - Jonker-Volgenant Algorithm for Linear Assignment Problem V3.0 A Matlab implementation of the Jonker-Volgenant algorithm solving LAPs. Author: Yi Cao

Very usefull code!! Compared to the version 1.1 the version 2.2 seems to be also capable to manage Inf values in the cost matrix. Yi, is it correct?

30 Sep 2010 Efficient convertors between binary and decimal numbers Alternatives to the built-in functions bin2dec & dec2bin, exhibiting a somewhat faster performance. Author: Zacharias Voulgaris

A little bug for the trivial input value: x=1. Add these lines to fix:
if x==1
y=1;
return
end

Comments and Ratings on Roberto Olmi's Files View all
Updated File Comment by Comments Rating
15 Apr 2012 Heuristic Algorithm for finding Maximum Independent Set Outputs the independent set of maximum cardinality. Runs in O(n^2) time, n=graph size. Author: Roberto Olmi lisa

01 May 2011 Binary Search of Elements lying within an Interval Search all elements (in a sorted vector of n elem.) that lie within an interval. It runs in log(n). Author: Roberto Olmi Igor

Seems like there's no bugs I've mentioned now for version Updated 15 Apr 2011.

14 Apr 2011 Binary Search of Elements lying within an Interval Search all elements (in a sorted vector of n elem.) that lie within an interval. It runs in log(n). Author: Roberto Olmi Igor

Great tool!, however,there's something wrong with integer inputs.

Contact us