Skip to main content
guest
Join
|
Help
|
Sign In
chessprogramming
Home
guest
|
Join
|
Help
|
Sign In
Wiki Home
Recent Changes
Pages and Files
Members
Home
Basics
Getting Started
Board Representation
Search
Evaluation
Principle Topics
Chess
Programming
Artificial Intelligence
Knowledge
Learning
Testing
Tuning
User Interface
Protocols
Dictionary
Lists
Arts
Cartoons
CC Forums
Conferences
Dedicated CC
Engines
Games
Hardware
History
Organizations
Papers
People
Periodical
Samples
Software
Timeline
Tournaments and Matches
Videos
Misc
Acknowledgments
On New Pages
Recommended Reading
Wikispaces Help
Ramón Galán
Edit
0
6
…
2
Tags
people
researcher
Notify
RSS
Backlinks
Source
Print
Export (PDF)
Table of Contents
Selected Publications
External Links
References
What links here?
Home
*
People
* Ramón Galán
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
[1]
, Ramón Galán and
Pablo San Segundo
mention
Bitscan by Modulo
for finding 1-bits in a very efficient and practically no space consuming way, at that time not yet aware of
De Bruijn multiplication
[2]
.
Selected Publications
[3]
Pablo San Segundo
,
Ramón Galán
(
2005
).
Bitboards: A New Approach
.
AIA 2005
Pablo San Segundo
,
Ramón Galán
,
Fernando Matía
,
Diego Rodríguez-Losada
,
Agustín Jiménez
(
2006
).
Efficient Search Using Bitboard Models
.
ICTAI 2006
,
pdf
Pablo San Segundo
,
Diego Rodríguez-Losada
,
Fernando Matía
,
Ramón Galán
(
2010
).
Fast exact feature based data correspondence search with an efficient bit-parallel MCP solver
.
Applied Intelligence Vol. 32 No. 3
[4]
External Links
Ramón Galán | ARABOT
(broken)
Intelligent Control Group | Ramon Galan
References
^
Pablo San Segundo
,
Ramón Galán
(
2005
).
Bitboards: A New Approach
.
AIA 2005
^
Charles E. Leiserson
,
Harald Prokop
and
Keith H. Randall
(
1998
).
Using de Bruijn Sequences to Index a 1 in a Computer Word
,
pdf
^
DBLP: Ramón Galán
^
Clique problem from Wikipedia
What links here?
Page
Date Edited
Bitboards
Nov 14, 2017
BitScan
Sep 10, 2017
Diego Rodríguez-Losada
Feb 25, 2015
Fernando Matía
Feb 25, 2015
Pablo San Segundo
Feb 25, 2015
People
Feb 28, 2018
Ramón Galán
Feb 25, 2015
Technical University of Madrid
Feb 25, 2015
Up one Level
Javascript Required
You need to enable Javascript in your browser to edit pages.
help on how to format text
Turn off "Getting Started"
Home
...
Loading...
Table of Contents
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 [1], Ramón Galán and Pablo San Segundo mention Bitscan by Modulo for finding 1-bits in a very efficient and practically no space consuming way, at that time not yet aware of De Bruijn multiplication [2].
Selected Publications
[3]External Links
References
What links here?
Up one Level