Sciweavers

1073 search results - page 31 / 215
» Formal Program Development with Approximations
Sort
View
EMNLP
2009
13 years 6 months ago
Feature-Rich Translation by Quasi-Synchronous Lattice Parsing
We present a machine translation framework that can incorporate arbitrary features of both input and output sentences. The core of the approach is a novel decoder based on lattice...
Kevin Gimpel, Noah A. Smith
SIGADA
2005
Springer
14 years 2 months ago
Optimizing the SPARK program slicer
Recent trends in software re-engineering have included tools to extract program slices from existing Ada procedures. One such tool has already been developed that extracts program...
Ricky E. Sward, Leemon C. Baird III
CAD
2011
Springer
13 years 7 days ago
Industrial design using interpolatory discrete developable surfaces
Design using free-form developable surfaces plays an important role in manufacturing industry. Currently most commercial systems can only support converting free-form surfaces int...
Yong-Jin Liu, Kai Tang, Wen-Yong Gong, Tie-Ru Wu
IANDC
2006
86views more  IANDC 2006»
13 years 8 months ago
Table design in dynamic programming
Dynamic Programming solves combinatorial optimization problems by recursive decomposition and tabulation of intermediate results. The first step in the design of a dynamic program...
Peter Steffen, Robert Giegerich
CP
2003
Springer
14 years 1 months ago
Approximated Consistency for Knapsack Constraints
Knapsack constraints are a key modeling structure in discrete optimization and form the core of many real-life problem formulations. Only recently, a cost-based filtering algorit...
Meinolf Sellmann