AIC Seminar Series
Backdoors in Combinatorial Problems
|Carla P. Gomes||Cornell University |
Date: Monday, March 21st 2005 at 4:00pm
Location: EJ228 (Directions)
We show that the inherent combinatorial structure of many real-world
combinatorial problem instances can be captured by a surprisingly small
set of variables. We call such variables ``backdoor variables. We present
theoretical results that explain the good scaling behavior of current search
methods that implicitly exploit backdoors in combinatorial search.
Carla Gomes received her Ph.D. in Computer Science, in the area of
Artificial Intelligence and Operations Research, from the University
of Edinburgh. She also holds an M.Sc. in Applied Mathematics from the
University of Lisbon. Her research has covered several areas in
artificial intelligence and computer science, including planning and
scheduling, integration of CSP and OR techniques for solving
combinatorial problems, and algorithm portfolios. Carla Gomes is an
associate professor of Computing and Information Science and Applied
Economics and Management at Cornell University. She is also the
director of the Intelligent Information Institute at Cornell.
Please arrive at least 10 minutes early as you will need to sign in by
following instructions by the lobby phone at Building E (or call Wilma
Lenz at 650 859 4904, or Vicenta at Lopez at 650 859 5750). SRI is
located at 333 Ravenswood Avenue in Menlo Park. Visitors may park in the
parking lots off Fourth Street. Detailed directions to SRI, as well as maps,
are available from the Visiting AIC web page.
There are two entrances to SRI International located on Ravenswood Ave.
Please check the Building E entrance signage.
©2017 SRI International 333 Ravenswood Avenue, Menlo Park, CA 94025-3493