Conference paper
Reasoning about RoboCup soccer narratives
Hannaneh Hajishirzi, Julia Hockenmaier, et al.
UAI 2011
Combinatorial optimization can be described as the problem of finding a feasible subset that maximizes a objective function. The paper discusses combinatorial optimization problems, where for each dimension the set of feasible subsets is fixed. It is demonstrated that in some cases fixing the structure makes the problem easier, whereas in general the problem remains NP-complete.
Hannaneh Hajishirzi, Julia Hockenmaier, et al.
UAI 2011
Igor Devetak, Andreas Winter
ISIT 2003
Vladimir Yanovski, Israel A. Wagner, et al.
Ann. Math. Artif. Intell.
William Hinsberg, Joy Cheng, et al.
SPIE Advanced Lithography 2010