Sciweavers

55 search results - page 4 / 11
» Hiding Satisfying Assignments: Two Are Better than One
Sort
View
IOR
2007
106views more  IOR 2007»
13 years 8 months ago
Planning and Scheduling by Logic-Based Benders Decomposition
We combine mixed integer linear programming (MILP) and constraint programming (CP) to solve an important class of planning and scheduling problems. Tasks are allocated to faciliti...
John N. Hooker
AAAI
2006
13 years 10 months ago
Semi-supervised Multi-label Learning by Constrained Non-negative Matrix Factorization
We present a novel framework for multi-label learning that explicitly addresses the challenge arising from the large number of classes and a small size of training data. The key a...
Yi Liu, Rong Jin, Liu Yang
ACL
2004
13 years 10 months ago
An Empirical Study of Information Synthesis Task
This paper describes an empirical study of the "Information Synthesis" task, defined as the process of (given a complex information need) extracting, organizing and inte...
Enrique Amigó, Julio Gonzalo, Víctor...
DATE
1998
IEEE
92views Hardware» more  DATE 1998»
14 years 26 days ago
Restructuring Logic Representations with Easily Detectable Simple Disjunctive Decompositions
Simple disjunctive decomposition is a special case of logic function decompositions, where variables are divided into two disjoint sets and there is only one newly introduced vari...
Hiroshi Sawada, Shigeru Yamashita, Akira Nagoya
TCAD
2010
194views more  TCAD 2010»
13 years 3 months ago
Layout Decomposition Approaches for Double Patterning Lithography
Abstract--In double patterning lithography (DPL) layout decomposition for 45nm and below process nodes, two features must be assigned opposite colors (corresponding to different ex...
Andrew B. Kahng, Chul-Hong Park, Xu Xu, Hailong Ya...