Sciweavers

336 search results - page 37 / 68
» Program Speedups in Theory and Practice
Sort
View
125
Voted
ACL
1997
15 years 1 months ago
Representing Constraints with Automata
In this paper we describe an approach to constraint based syntactic theories in terms of finite tree automata. The solutions to constraints expressed in weak monadic second order ...
Frank Morawietz, Tom Cornell
CP
2005
Springer
15 years 6 months ago
Breaking All Value Symmetries in Surjection Problems
We propose a surprisingly simple new way of breaking all value symmetries with constraints. Our method requires the addition of one variable per value of the problem plus a linear ...
Jean-Francois Puget
MPC
1998
Springer
83views Mathematics» more  MPC 1998»
15 years 4 months ago
Nested Datatypes
A nested datatype, also known as a non-regular datatype, is a parametrised datatype whose declaration involves different instances of the accompanying type parameters. Nested datat...
Richard S. Bird, Lambert G. L. T. Meertens
SIAMJO
2010
87views more  SIAMJO 2010»
14 years 11 months ago
A Second Derivative SQP Method: Global Convergence
Abstract. Sequential quadratic programming (SQP) methods form a class of highly efficient algorithms for solving nonlinearly constrained optimization problems. Although second deri...
Nicholas I. M. Gould, Daniel P. Robinson
ML
2006
ACM
113views Machine Learning» more  ML 2006»
15 years 6 months ago
A separate compilation extension to standard ML
We present an extension to Standard ML, called SMLSC, to support separate compilation. The system gives meaning to individual program fragments, called units. Units may depend on ...
David Swasey, Tom Murphy VII, Karl Crary, Robert H...