2861 search results - page 343 / 573 » Constraint Programming |
145
click to vote
DSVIS
2003
Springer
15 years 11 months ago
2003
Springer
Modern industrial-strength user interface toolkits are usually described informally, in terms of implementation artifacts such as objects and imperative state. While the practical...
125
click to vote
EMNLP
2008
15 years 8 months ago
2008
We introduce a method for solving substitution ciphers using low-order letter n-gram models. This method enforces global constraints using integer programming, and it guarantees t...
165
click to vote
CVPR
2010
IEEE
16 years 2 months ago
2010
IEEE
In this paper, we propose a new shape decomposition method, called convex shape decomposition. We formalize the convex decomposition problem as an integer linear programming probl...
160
click to vote
HICSS
2000
IEEE
15 years 11 months ago
2000
IEEE
This paper describes the basis for a suite of tools that let the programmer work in terms of design patterns and source code simultaneously. It first introduces a language for de...
193
click to vote
ESOP
2009
Springer
16 years 1 months ago
2009
Springer
Hofmann and Jost have presented a heap space analysis [1] that finds linear space bounds for many functional programs. It uses an amortised analysis: assigning hypothetical amount...