Sciweavers

42 search results - page 5 / 9
» Specialising Finite Domain Programs Using Polyhedra
Sort
View
CP
2007
Springer
14 years 5 months ago
Propagation = Lazy Clause Generation
Finite domain propagation solvers effectively represent the possible values of variables by a set of choices which can be naturally modelled as Boolean variables. In this paper we...
Olga Ohrimenko, Peter J. Stuckey, Michael Codish
MCS
2008
Springer
13 years 10 months ago
Numerical optimal control of the wave equation: optimal boundary control of a string to rest in finite time
In many real-life applications of optimal control problems with constraints in form of partial differential equations (PDEs), hyperbolic equations are involved which typically desc...
Matthias Gerdts, Günter Greif, Hans Josef Pes...
ENTCS
2010
72views more  ENTCS 2010»
13 years 8 months ago
View-Augmented Abstractions
mented Abstractions Matt Eldera,1 , Denis Gopanb,2 , and Thomas Repsa,b,3 a Computer Sciences Department, Univ. of Wisconsin; Madison, WI; USA b GrammaTech, Inc.; Ithaca, NY; USA ...
Matt Elder, Denis Gopan, Thomas W. Reps
STACS
2000
Springer
14 years 2 months ago
Multi-linearity Self-Testing with Relative Error
We investigate self-testing programs with relative error by allowing error terms proportional to the function to be computed. Until now, in numerical computation, error terms were ...
Frédéric Magniez
JOOP
1998
98views more  JOOP 1998»
13 years 10 months ago
Design Patterns as Language Constructs
Design patterns have proven to be very useful for the design of object-oriented systems. The power of design patterns stems from their ability to provide generic solutions to reap...
Jan Bosch