Rank: 2777 based on 15 downloads (last 30 days) and 3 files submitted

Roberto Olmi

E-mail: Contact Author
Company/University: Elettric80 S.p.A. - www.elettric80.it
Lat/Long: 44.72964477539062, 10.54220008850098

Personal Profile:: PhD, Eng.
See my Curriculum Vitae (Italian):
https://sites.google.com/site/robertoolmi/curriculum-vitae-1
Professional Interests:: Automated Guided Vehicles

Watch this Author's files

Files
Watch Lists

Files Posted by Roberto					View all 1 - 3 of 3
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, search, interval search, matching, search with tolerance	5	2	5.0 5.0 \| 2 ratings
23 Oct 2010		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	9	0
04 Sep 2008		2D minimal segments distance Computes the minimal distace between two segments Author: Roberto Olmi	2d, euclidean, segments, segment, distance, measurements	1	0

Comments and Ratings by Roberto		View all 1 - 5 of 5
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 V2.4 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 V2.4 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's Files			View all 1 - 2 of 2
Updated	File	Comment by	Comments	Rating
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.

Top Tags Applied by Roberto	1 - 5 of 24
2d, binary search, clique, constrained optimization, distance

Files Tagged by Roberto					View all 1 - 3 of 3
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, search, interval search, matching, search with tolerance	5	2	5.0 5.0 \| 2 ratings
23 Oct 2010		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	9	0
04 Sep 2008		2D minimal segments distance Computes the minimal distace between two segments Author: Roberto Olmi	2d, euclidean, segments, segment, distance, measurements	1	0

Currently Watching
Type	Description
File	Binary Search of Elements lying within an Interval
File	Heuristic Algorithm for finding Maximum Independent Set
File	dijsktra path finder

Files Matching Roberto's Watch List					View all 1 - 3 of 3
Updated		File	Tags	Downloads (last 30 days)	Comments	Rating
17 Nov 2011		dijsktra path finder Mex implementation of the dijkstra algorithm Author: Sebastien Paris	dijsktra, adjacency matrix, optimization, optimal	38	6	1.5 1.5 \| 2 ratings
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, search, interval search, matching, search with tolerance	5	2	5.0 5.0 \| 2 ratings
23 Oct 2010		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	9	0

Comments and Ratings Matching Roberto's Watch List			1-5 of 8
Date	File	Comment by	Comments	Rating
16 Nov 2011	dijsktra path finder Mex implementation of the dijkstra algorithm	Sebastien Paris	Roberto, Thank your for reporting. I will update with your modification. Sébastien	Comment only
16 Nov 2011	dijsktra path finder Mex implementation of the dijkstra algorithm	Roberto Olmi	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...	Comment only
16 Nov 2011	dijsktra path finder Mex implementation of the dijkstra algorithm	Roberto Olmi	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	Comment only
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).	Igor	Seems like there's no bugs I've mentioned now for version Updated 15 Apr 2011.	5
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).	Igor	Great tool!, however,there's something wrong with integer inputs.	4

Contact us at files@mathworks.com