Sciweavers

598 search results - page 15 / 120
» The Puzzle Layout Problem
Sort
View
SAC
1997
ACM
13 years 11 months ago
Crozzle: an NP-complete problem
At the 1996 Symposium on Applied Computing, it was argued that the R-by-C Crozzle problem was NP-Hard, but not in NP. The original Crozzle problem is a word puzzle that appears, w...
David Binkley, Bradley M. Kuhn
DAGSTUHL
2007
13 years 9 months ago
Prioritized Conditional Imperatives: Problems and a New Proposal
Abstract. The sentences of deontic logic may be understood as describing what an agent ought to do when faced with a given set of norms. If these norms come into conflict, the bes...
Jörg Hansen
ICCAD
2008
IEEE
141views Hardware» more  ICCAD 2008»
14 years 4 months ago
Layout decomposition for double patterning lithography
In double patterning lithography (DPL) layout decomposition for 45nm and below process nodes, two features must be assigned opposite colors (corresponding to different exposures)...
Andrew B. Kahng, Chul-Hong Park, Xu Xu, Hailong Ya...
ICDAR
2007
IEEE
14 years 1 months ago
Simultaneous Layout Style and Logical Entity Recognition in a Heterogeneous Collection of Documents
Logical entity recognition in heterogeneous collections of document page images remains a challenging problem since the performance of traditional supervised methods degrade drama...
S. Chen, S. Mao, G. Thoma
SOFSEM
1997
Springer
13 years 11 months ago
Path Layout in ATM Networks
This paper surveys recent results in the area of virtual path layout in ATM networks. We present a model for the theoretical study of these layouts the model amounts to covering t...
Shmuel Zaks