Difference between revisions of "Ramón Galán"

From Chessprogramming wiki
Jump to: navigation, search
(Created page with "'''Home * People * Ramón Galán''' FILE:Ramon_Galan.jpg|border|right|thumb| Ramón Galán <ref>[https://www.researchgate.net/profile/Ramon_Galan Ramón G...")
 
Line 14: Line 14:
 
* [[Pablo San Segundo]], [[Ramón Galán]] ('''2005'''). ''[http://www.actapress.com/Abstract.aspx?paperId=18953 Bitboards: A New Approach]''. [https://dblp.uni-trier.de/db/conf/aia/aia2005.html AIA 2005]
 
* [[Pablo San Segundo]], [[Ramón Galán]] ('''2005'''). ''[http://www.actapress.com/Abstract.aspx?paperId=18953 Bitboards: A New Approach]''. [https://dblp.uni-trier.de/db/conf/aia/aia2005.html AIA 2005]
 
* [[Pablo San Segundo]], [[Ramón Galán]], [[Fernando Matía]], [[Diego Rodríguez-Losada]], [[Agustín Jiménez]] ('''2006'''). ''[https://ieeexplore.ieee.org/document/4031890 Efficient Search Using Bitboard Models]''. [https://dblp.uni-trier.de/db/conf/ictai/ictai2006.html ICTAI 2006]
 
* [[Pablo San Segundo]], [[Ramón Galán]], [[Fernando Matía]], [[Diego Rodríguez-Losada]], [[Agustín Jiménez]] ('''2006'''). ''[https://ieeexplore.ieee.org/document/4031890 Efficient Search Using Bitboard Models]''. [https://dblp.uni-trier.de/db/conf/ictai/ictai2006.html ICTAI 2006]
* [[Pablo San Segundo]], [[Diego Rodríguez-Losada]], [[Ramón Galán]] , [[Fernando Matía]], [[Agustín Jiménez]] ('''2007'''). ''[https://ieeexplore.ieee.org/document/4410262 Exploiting CPU Bit Parallel Operations to Improve Efficiency in Search]''. [https://dblp.uni-trier.de/db/conf/ictai/ictai2007-1.html ICTAI 2007]
+
* [[Pablo San Segundo]], [[Diego Rodríguez-Losada]], [[Ramón Galán]], [[Fernando Matía]], [[Agustín Jiménez]] ('''2007'''). ''[https://ieeexplore.ieee.org/document/4410262 Exploiting CPU Bit Parallel Operations to Improve Efficiency in Search]''. [https://dblp.uni-trier.de/db/conf/ictai/ictai2007-1.html ICTAI 2007]
 
==2010 ...==
 
==2010 ...==
 
* [[Pablo San Segundo]], [[Diego Rodríguez-Losada]], [[Fernando Matía]], [[Ramón Galán]] ('''2010'''). ''[https://dl.acm.org/citation.cfm?id=1824946&dl Fast exact feature based data correspondence search with an efficient bit-parallel MCP solver]''. [https://dblp.uni-trier.de/db/journals/apin/apin32.html Applied Intelligence Vol. 32 No. 3] <ref>[https://en.wikipedia.org/wiki/Clique_problem Clique problem from Wikipedia]</ref>
 
* [[Pablo San Segundo]], [[Diego Rodríguez-Losada]], [[Fernando Matía]], [[Ramón Galán]] ('''2010'''). ''[https://dl.acm.org/citation.cfm?id=1824946&dl Fast exact feature based data correspondence search with an efficient bit-parallel MCP solver]''. [https://dblp.uni-trier.de/db/journals/apin/apin32.html Applied Intelligence Vol. 32 No. 3] <ref>[https://en.wikipedia.org/wiki/Clique_problem Clique problem from Wikipedia]</ref>

Revision as of 17:22, 6 February 2019

Home * People * Ramón Galán

Ramón Galán [1]

Ramón Galán,
a Spanish computer scientist and full professor in the area of systems engineering at Universidad Politécnica de Madrid (UPM). His main research areas have been in the area of process control, artificial intelligence, expert systems, and interactive Robots. In their 2005 paper, Bitboards: A New Approach [2], Ramón Galán and Pablo San Segundo mention Bitscan by Modulo for finding 1-bits in a practically no space consuming way, not yet aware of De Bruijn multiplication [3].

Selected Publications

[4]

2000 ...

2010 ...

External Links

References

Up one Level