Sciweavers

5090 search results - page 433 / 1018
» Constructing Strategies for Programming
Sort
View
CP
2004
Springer
15 years 10 months ago
Set Variables and Local Search
Many combinatorial (optimisation) problems have natural models based on, or including, set variables and set constraints. This was already known to the constraint programming commu...
Magnus Ågren
DSL
1997
15 years 8 months ago
Service Combinators for Web Computing
The World-Wide Web is rich in content and services, but access to these resources must be obtained mostly through manual browsers. We would like to be able to write programs that ...
Luca Cardelli, Rowan Davies
ICSQP
1994
15 years 8 months ago
Using Strongest Postconditions to Improve Software Quality
: The cost of developing and maintaining high quality software remains at a premium. In this paper we introduce a practical approach for enhancement of software quality, based on c...
Si Pan, R. Geoff Dromey
CORR
2008
Springer
80views Education» more  CORR 2008»
15 years 7 months ago
A Dual Polynomial for OR
We reprove that the approximate degree of the OR function on n bits is ( n). We consider a linear program which is feasible if and only if there is an approximate polynomial for ...
Robert Spalek
ENTCS
2006
120views more  ENTCS 2006»
15 years 6 months ago
SCHOOL: a Small Chorded Object-Oriented Language
Chords are a declarative synchronisation construct based on the Join-Calculus, available in the programming language C. To our knowledge, chords have no formal model in an object-...
Sophia Drossopoulou, Alexis Petrounias, Alex Buckl...