Difference between revisions of "Fernando Matía"

From Chessprogramming wiki
Jump to: navigation, search
 
Line 3: Line 3:
 
'''Fernando Matía''',<br/>
 
'''Fernando Matía''',<br/>
 
a Spanish computer scientist and full professor in the area of [https://en.wikipedia.org/wiki/Systems_engineering systems engineering] at [[Technical University of Madrid|Universidad Politécnica de Madrid]] (UPM). His main research areas have been in the area of [https://en.wikipedia.org/wiki/Fuzzy_control_system Fuzzy control] and interactive [[Robots]].  
 
a Spanish computer scientist and full professor in the area of [https://en.wikipedia.org/wiki/Systems_engineering systems engineering] at [[Technical University of Madrid|Universidad Politécnica de Madrid]] (UPM). His main research areas have been in the area of [https://en.wikipedia.org/wiki/Fuzzy_control_system Fuzzy control] and interactive [[Robots]].  
He published along with [[Pablo San Segundo]] et al. on [[Bitboards|bitboards]] <ref>[[Pablo San Segundo]], [[Ramón Galán]], [[Fernando Matía]], [[Diego Rodríguez-Losada]], [[Agustín Jiménez]] ('''2006'''). ''[http://dl.acm.org/citation.cfm?id=1191130 Efficient Search Using Bitboard Models]''. [http://www.informatik.uni-trier.de/%7Eley/db/conf/ictai/ictai2006.html#SegundoGMRJ06 ICTAI 2006], [http://www.intelligentcontrol.es/diego/publications/SanSegundo_Ictai06.pdf pdf]</ref> and an efficient bit-parallel [https://en.wikipedia.org/wiki/Clique_problem Maximum clique problem] solver <ref>[[Pablo San Segundo]], [[Diego Rodríguez-Losada]], [[Fernando Matía]], [[Ramón Galán]] ('''2010'''). ''[http://dl.acm.org/citation.cfm?id=1824946&dl Fast exact feature based data correspondence search with an efficient bit-parallel MCP solver]''. [http://www.informatik.uni-trier.de/~ley/db/journals/apin/apin32.html#SegundoRMG10 Applied Intelligence Vol. 32 No. 3]</ref>.  
+
He published along with [[Pablo San Segundo]] et al. on [[Bitboards|bitboards]] <ref>[[Pablo San Segundo]], [[Ramón Galán]], [[Fernando Matía]], [[Diego Rodríguez-Losada]], [[Agustín Jiménez]] ('''2006'''). ''[http://dl.acm.org/citation.cfm?id=1191130 Efficient Search Using Bitboard Models]''. [http://www.informatik.uni-trier.de/%7Eley/db/conf/ictai/ictai2006.html#SegundoGMRJ06 ICTAI 2006]</ref> and an efficient bit-parallel [https://en.wikipedia.org/wiki/Clique_problem Maximum clique problem] solver <ref>[[Pablo San Segundo]], [[Diego Rodríguez-Losada]], [[Fernando Matía]], [[Ramón Galán]] ('''2010'''). ''[http://dl.acm.org/citation.cfm?id=1824946&dl Fast exact feature based data correspondence search with an efficient bit-parallel MCP solver]''. [http://www.informatik.uni-trier.de/~ley/db/journals/apin/apin32.html#SegundoRMG10 Applied Intelligence Vol. 32 No. 3]</ref>.  
  
 
=Selected Publications=  
 
=Selected Publications=  

Latest revision as of 22:19, 7 February 2019

Home * People * Fernando Matía

Fernando Matía,
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 Fuzzy control and interactive Robots. He published along with Pablo San Segundo et al. on bitboards [1] and an efficient bit-parallel Maximum clique problem solver [2].

Selected Publications

[3]

1998 ...

2000 ...

2010 ...

External Links

References

Up one Level