Sciweavers

176 search results - page 18 / 36
» heuristics 1998
Sort
View
ACL
1998
13 years 9 months ago
HPSG-Style Underspecified Japanese Grammar with Wide Coverage
This paper describes a wide-coverage Japanese grammar based on HPSG. The aim of this work is to see the coverage and accuracy attainable using an underspecified grammar. Underspec...
Yutaka Mitsuishi, Kentaro Torisawa, Jun-ichi Tsuji...
SODA
1998
ACM
113views Algorithms» more  SODA 1998»
13 years 9 months ago
Fast Hierarchical Clustering and Other Applications of Dynamic Closest Pairs
We develop data structures for dynamic closest pair problems with arbitrary (not necessarily geometric) distance functions, based on a technique previously used by the author for ...
David Eppstein
DAC
1998
ACM
14 years 8 months ago
Exact Tree-based FPGA Technology Mapping for Logic Blocks with Independent LUTs
The logic blocks CLBs of a lookup table LUT based FPGA consist of one or more LUTs, possibly of di erent sizes. In this paper, we focus on technology mapping for CLBs with several...
Madhukar R. Korupolu, K. K. Lee, D. F. Wong
ASPDAC
1998
ACM
119views Hardware» more  ASPDAC 1998»
13 years 11 months ago
Integer Programming Models for Optimization Problems in Test Generation
— Test Pattern Generation for combinational circuits entails the identification of primary input assignments for detecting each fault in a set of target faults. An extension to ...
João P. Marques Silva
CP
1998
Springer
13 years 11 months ago
Modelling CSP Solution Algorithms with Petri Decision Nets
The constraint paradigm provides powerful concepts to represent and solve different kinds of planning problems, e. g. factory scheduling. Factory scheduling is a demanding optimiz...
Stephan Pontow