Difference between revisions of "Pablo San Segundo"

From Chessprogramming wiki
Jump to: navigation, search
(Created page with "'''Home * People * Pablo San Segundo''' FILE:San segundo carrillo pablo 20081119 olympiade dresden.jpg|border|right|thumb|220px| Pablo San Segundo <ref>Pa...")
 
 
(7 intermediate revisions by the same user not shown)
Line 5: Line 5:
 
'''Pablo San Segundo Carrillo''',<br/>
 
'''Pablo San Segundo Carrillo''',<br/>
 
a Spanish [https://en.wikipedia.org/wiki/Grandmaster_%28chess%29 chess grandmaster], [https://en.wikipedia.org/wiki/Spanish_Chess_Championship Spanish chess champion] in 1997 and member of the Olympic team since 1994, computer scientist and associate professor at the [[Technical University of Madrid|Universidad Politécnica de Madrid]] (UPM).  
 
a Spanish [https://en.wikipedia.org/wiki/Grandmaster_%28chess%29 chess grandmaster], [https://en.wikipedia.org/wiki/Spanish_Chess_Championship Spanish chess champion] in 1997 and member of the Olympic team since 1994, computer scientist and associate professor at the [[Technical University of Madrid|Universidad Politécnica de Madrid]] (UPM).  
−
His research interests include [https://en.wikipedia.org/wiki/Heuristic heuristics], [https://en.wikipedia.org/wiki/Combinatorics combinatorics], [https://en.wikipedia.org/wiki/Game_theory game theory], [https://en.wikipedia.org/wiki/Graph_theory graph theory], and [[Artificial Intelligence|AI]] search- and [https://en.wikipedia.org/wiki/Optimization_problem optimization problems] in general, specially applying [[Bitboards|bitboards]].  
+
His research interests include [https://en.wikipedia.org/wiki/Heuristic heuristics], [https://en.wikipedia.org/wiki/Combinatorics combinatorics], [https://en.wikipedia.org/wiki/Game_theory game theory], [https://en.wikipedia.org/wiki/Graph_theory graph theory], [https://en.wikipedia.org/wiki/Clique_problem clique problems] and [https://en.wikipedia.org/wiki/Graph_coloring#Vertex_coloring vertex coloring], and [[Artificial Intelligence|AI]] search- and [https://en.wikipedia.org/wiki/Optimization_problem optimization problems] in general, specially applying [[Bitboards|bitboards]].  
−
In their 2005 paper, ''Bitboards: A New Approach'' <ref>[[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]</ref> , Pablo San Segundo and [[Ramón Galán]] mention [[BitScan#BitscanByModulo|Bitscan by Modulo]] for finding 1-bits in a very efficient and practically no space consuming way, at that time not aware of [[BitScan#DeBruijnMultiplation|De Bruijn multiplication]] as proposed by [[Charles Leiserson]] et al. in 1998 <ref>[[Charles Leiserson|Charles E. Leiserson]], [[Harald Prokop]], [[Keith H. Randall]] ('''1998'''). ''Using de Bruijn Sequences to Index a 1 in a Computer Word''. [http://supertech.csail.mit.edu/papers/debruijn.pdf pdf]</ref>, which is however mentioned in Segundo et al. 2011 on [[#BBMC|BBMC]] <ref>[[Pablo San Segundo]], [[Diego Rodríguez-Losada]], [[Agustín Jiménez]] ('''2011'''). ''[https://www.sciencedirect.com/science/article/pii/S0305054810001504 An exact bit-parallel algorithm for the maximum clique problem]''. [https://dblp.uni-trier.de/db/journals/cor/cor38.html Computers & Operations Research, Vol. 38, No. 2], 2 Preliminaries 2.2 Bit-parallel computation</ref>.  
+
In their 2005 paper, ''Bitboards: A New Approach'' <ref>[[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]</ref> , Pablo San Segundo and [[Ramón Galán]] mention [[BitScan#BitscanByModulo|Bitscan by Modulo]] for finding 1-bits in a practically no space consuming way, at that time likely not yet aware of [[BitScan#DeBruijnMultiplation|De Bruijn multiplication]] as proposed by [[Charles Leiserson]] et al. in 1998 <ref>[[Charles Leiserson|Charles E. Leiserson]], [[Harald Prokop]], [[Keith H. Randall]] ('''1998'''). ''Using de Bruijn Sequences to Index a 1 in a Computer Word''. [http://supertech.csail.mit.edu/papers/debruijn.pdf pdf]</ref>, which is however mentioned in Segundo et al. 2011 on [[#BBMC|BBMC]] <ref>[[Pablo San Segundo]], [[Diego Rodríguez-Losada]], [[Agustín Jiménez]] ('''2011'''). ''[https://www.sciencedirect.com/science/article/pii/S0305054810001504 An exact bit-parallel algorithm for the maximum clique problem]''. [https://dblp.uni-trier.de/db/journals/cor/cor38.html Computers & Operations Research, Vol. 38, No. 2], 2 Preliminaries 2.2 Bit-parallel computation</ref>.  
  
 
=BITSCAN=
 
=BITSCAN=
Line 20: Line 20:
 
* [[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]
 
* [[Pablo San Segundo]], [[Agustín Jiménez]]  ('''2007'''). ''[https://ieeexplore.ieee.org/document/5366833 Using Graphs to Derive CSP Heuristics and its Application to Sudoku]''. [https://dblp.uni-trier.de/db/conf/ictai/ictai2009.html ICTAI 2009]
 
* [[Pablo San Segundo]], [[Agustín Jiménez]]  ('''2007'''). ''[https://ieeexplore.ieee.org/document/5366833 Using Graphs to Derive CSP Heuristics and its Application to Sudoku]''. [https://dblp.uni-trier.de/db/conf/ictai/ictai2009.html ICTAI 2009]
 
==2010 ...==
 
==2010 ...==
Line 26: Line 26:
 
* [[Pablo San Segundo]], [[Diego Rodríguez-Losada]], [[Agustín Jiménez]] ('''2011'''). ''[https://www.sciencedirect.com/science/article/pii/S0305054810001504 An exact bit-parallel algorithm for the maximum clique problem]''. [https://dblp.uni-trier.de/db/journals/cor/cor38.html Computers & Operations Research, Vol. 38, No. 2]
 
* [[Pablo San Segundo]], [[Diego Rodríguez-Losada]], [[Agustín Jiménez]] ('''2011'''). ''[https://www.sciencedirect.com/science/article/pii/S0305054810001504 An exact bit-parallel algorithm for the maximum clique problem]''. [https://dblp.uni-trier.de/db/journals/cor/cor38.html Computers & Operations Research, Vol. 38, No. 2]
 
* [[Pablo San Segundo]] ('''2011'''). ''[https://link.springer.com/article/10.1007%2Fs10898-011-9653-x New decision rules for exact search in N-Queens]''. [https://dblp.uni-trier.de/db/journals/jgo/jgo51.html Journal of Global Optimization, Vol. 51, No. 3]
 
* [[Pablo San Segundo]] ('''2011'''). ''[https://link.springer.com/article/10.1007%2Fs10898-011-9653-x New decision rules for exact search in N-Queens]''. [https://dblp.uni-trier.de/db/journals/jgo/jgo51.html Journal of Global Optimization, Vol. 51, No. 3]
−
* [[Pablo San Segundo]] ('''2012'''). ''[https://www.sciencedirect.com/science/article/pii/S0305054811002966 A new DSATUR-based algorithm for exact vertex coloring[''. [https://dblp.uni-trier.de/db/journals/cor/cor39.html Computers & Operations Research, Vol. 39, No. 7]
+
* [[Pablo San Segundo]] ('''2012'''). ''[https://www.sciencedirect.com/science/article/pii/S0305054811002966 A new DSATUR-based algorithm for exact vertex coloring]''. [https://dblp.uni-trier.de/db/journals/cor/cor39.html Computers & Operations Research, Vol. 39, No. 7]
 
* [[Pablo San Segundo]], [[Diego Rodríguez-Losada]] ('''2013'''). ''[https://ieeexplore.ieee.org/document/6527958 Robust Global Feature Based Data Association With a Sparse Bit Optimized Maximum Clique Algorithm]''. [[IEEE#Tor|IEEE Transactions on Robotics]], Vol. 29, No. 5
 
* [[Pablo San Segundo]], [[Diego Rodríguez-Losada]] ('''2013'''). ''[https://ieeexplore.ieee.org/document/6527958 Robust Global Feature Based Data Association With a Sparse Bit Optimized Maximum Clique Algorithm]''. [[IEEE#Tor|IEEE Transactions on Robotics]], Vol. 29, No. 5
 +
* [[Pablo San Segundo]], [[Fernando Matía]], [[Diego Rodríguez-Losada]], [[Miguel Hernando]] ('''2013'''). ''[https://link.springer.com/article/10.1007/s11590-011-0431-y An improved bit parallel exact maximum clique algorithm]''. [https://dblp.uni-trier.de/db/journals/ol/ol7.html Optimization Letters, Vol. 7], No. 3
 +
* [[Diego Rodríguez-Losada]], [[Pablo San Segundo]], [[Miguel Hernando]], [https://dblp.uni-trier.de/pers/hd/p/Puente:Paloma_de_la Paloma de la Puente], [https://dblp.uni-trier.de/pers/hd/v/Valero=Gomez:Alberto Alberto Valero-Gomez] ('''2013'''). ''GPU-Mapping: Robotic Map Building with Graphical Multiprocessors''. [https://dblp.uni-trier.de/db/journals/ram/ram20.html IEEE Robotics & Automation Magazine, Vol. 20, No. 2], [https://www.acin.tuwien.ac.at/fileadmin/acin/v4r/v4r/GPUMap_RAM2013.pdf pdf]
 
==2015 ...==
 
==2015 ...==
 
* [[Pablo San Segundo]], [https://dblp.org/pers/hd/n/Nikolaev:Alexey Alexey Nikolaev], [https://scholar.google.ru/citations?user=MUQcdkAAAAAJ&hl=ru Mikhail Batsyn] ('''2015'''). ''[https://www.sciencedirect.com/science/article/pii/S0305054815001549 Infra-chromatic bound for exact maximum clique search]''. [https://dblp.uni-trier.de/db/journals/cor/cor64.html Computers & Operations Research, Vol. 64, No. 4]
 
* [[Pablo San Segundo]], [https://dblp.org/pers/hd/n/Nikolaev:Alexey Alexey Nikolaev], [https://scholar.google.ru/citations?user=MUQcdkAAAAAJ&hl=ru Mikhail Batsyn] ('''2015'''). ''[https://www.sciencedirect.com/science/article/pii/S0305054815001549 Infra-chromatic bound for exact maximum clique search]''. [https://dblp.uni-trier.de/db/journals/cor/cor64.html Computers & Operations Research, Vol. 64, No. 4]
−
* [https://dblp.uni-trier.de/pers/hd/k/Komosko:Larisa Larisa Komosko], [https://scholar.google.ru/citations?user=MUQcdkAAAAAJ&hl=ru Mikhail Batsyn], [[Pablo San Segundo]], [https://en.wikipedia.org/wiki/Panos_M._Pardalos Panos M. Pardalos] ('''2016'''). ''[https://link.springer.com/article/10.1007/s10878-015-9862-1 A fast greedy sequential heuristic for the vertex colouring problem based on bitwise operations]''. [https://dblp.uni-trier.de/db/journals/jco/jco31.html Journal of Combinatorial Optimization, Vol. 31]
+
* [https://dblp.uni-trier.de/pers/hd/k/Komosko:Larisa Larisa Komosko], [https://scholar.google.ru/citations?user=MUQcdkAAAAAJ&hl=ru Mikhail Batsyn], [[Pablo San Segundo]], [https://en.wikipedia.org/wiki/Panos_M._Pardalos Panos M. Pardalos] ('''2016'''). ''[https://link.springer.com/article/10.1007/s10878-015-9862-1 A fast greedy sequential heuristic for the vertex colouring problem based on bitwise operations]''. [https://dblp.uni-trier.de/db/journals/jco/jco31.html Journal of Combinatorial Optimization, Vol. 31, No- 4]
 
* [[Pablo San Segundo]], [https://dblp.uni-trier.de/pers/hd/a/Artieda:Jorge Jorge Artieda], [https://scholar.google.com/citations?user=BTW2e5AAAAAJ&hl=en Darren Strash] ('''2017'''). ''Efficiently Enumerating all Maximal Cliques with Bit-Parallelism''. [https://arxiv.org/abs/1801.00202 arXiv:1801.00202]
 
* [[Pablo San Segundo]], [https://dblp.uni-trier.de/pers/hd/a/Artieda:Jorge Jorge Artieda], [https://scholar.google.com/citations?user=BTW2e5AAAAAJ&hl=en Darren Strash] ('''2017'''). ''Efficiently Enumerating all Maximal Cliques with Bit-Parallelism''. [https://arxiv.org/abs/1801.00202 arXiv:1801.00202]
  
 
=External Links=  
 
=External Links=  
 
* [https://github.com/psanse psanse (Pablo San Segundo) · GitHub]
 
* [https://github.com/psanse psanse (Pablo San Segundo) · GitHub]
 +
* [https://scholar.google.com/citations?user=FVMSpIkAAAAJ&hl=en Pablo San Segundo - Google Scholar Citations]
 
* [https://es.wikipedia.org/wiki/Pablo_San_Segundo_Carrillo Pablo San Segundo Carrillo from Wikipedia.es] (Spanish)
 
* [https://es.wikipedia.org/wiki/Pablo_San_Segundo_Carrillo Pablo San Segundo Carrillo from Wikipedia.es] (Spanish)
 +
* [https://ratings.fide.com/card.phtml?event=2200082 San Segundo Carrillo, Pablo FIDE Chess Profile]
 
* [http://www.chessgames.com/perl/chessplayer?pid=89330 The chess games of Pablo San Segundo-Carrillo] from [http://www.chessgames.com/index.html chessgames.com]
 
* [http://www.chessgames.com/perl/chessplayer?pid=89330 The chess games of Pablo San Segundo-Carrillo] from [http://www.chessgames.com/index.html chessgames.com]
 
* [https://en.chessbase.com/post/ponomariov-catches-nakamura-loses-tiebreak Donostia-San Sebastian Chess Festival] by [http://www.davidllada.com/ David Llada], [[ChessBase|ChessBase news]], June 17, 2009
 
* [https://en.chessbase.com/post/ponomariov-catches-nakamura-loses-tiebreak Donostia-San Sebastian Chess Festival] by [http://www.davidllada.com/ David Llada], [[ChessBase|ChessBase news]], June 17, 2009

Latest revision as of 17:22, 6 February 2019

Home * People * Pablo San Segundo

Pablo San Segundo [1]

Pablo San Segundo Carrillo,
a Spanish chess grandmaster, Spanish chess champion in 1997 and member of the Olympic team since 1994, computer scientist and associate professor at the Universidad Politécnica de Madrid (UPM). His research interests include heuristics, combinatorics, game theory, graph theory, clique problems and vertex coloring, and AI search- and optimization problems in general, specially applying bitboards. In their 2005 paper, Bitboards: A New Approach [2] , Pablo San Segundo and Ramón Galán mention Bitscan by Modulo for finding 1-bits in a practically no space consuming way, at that time likely not yet aware of De Bruijn multiplication as proposed by Charles Leiserson et al. in 1998 [3], which is however mentioned in Segundo et al. 2011 on BBMC [4].

BITSCAN

Pablo San Segundo has released BITSCAN, an efficient C++ library for bitstrings which is optimized for scanning bit vectors of any size, and which he used to implement BBMC (BB-MaxClique), a state of the art maximum clique algorithm [5]. BBMC encodes the graph problem as bitstrings and uses bitmasks to implement the basic computations in the search. BITSCAN is publicly available a GitHub repository [6].

GRAPH

GRAPH, a small C++ library with a number of data types for bit-encoded graphs using BITSCAN has been released [7].

Selected Publications

[8]

2005 ...

2010 ...

2015 ...

External Links

References

  1. ↑ Pablo San Segundo at the 38th Chess Olympiad, Dresden 2008, Photo by Frank Hoppe, Pablo San Segundo Carrillo from Wikipedia.es (Spanish)
  2. ↑ Pablo San Segundo, Ramón Galán (2005). Bitboards: A New Approach. AIA 2005
  3. ↑ Charles E. Leiserson, Harald Prokop, Keith H. Randall (1998). Using de Bruijn Sequences to Index a 1 in a Computer Word. pdf
  4. ↑ Pablo San Segundo, Diego Rodríguez-Losada, Agustín Jiménez (2011). An exact bit-parallel algorithm for the maximum clique problem. Computers & Operations Research, Vol. 38, No. 2, 2 Preliminaries 2.2 Bit-parallel computation
  5. ↑ Pablo San Segundo, Diego Rodríguez-Losada, Agustín Jiménez (2011). An exact bit-parallel algorithm for the maximum clique problem. Computers & Operations Research, Vol. 38, No. 2
  6. ↑ GitHub - psanse/bitscan: C++ library for bit twiddling
  7. ↑ GitHub - psanse/graph: graph library for bit-encoded graphs with BITSCAN
  8. ↑ dblp: Pablo San Segundo
  9. ↑ Clique problem from Wikipedia

Up one Level

Retrieved from "https://www.chessprogramming.org/index.php?title=Pablo_San_Segundo&oldid=10447"