9626 search results - page 1657 / 1926 » Invariant Based Programming |
176
click to vote
CP
2003
Springer
15 years 11 months ago
2003
Springer
A binary constraints network consists of a set of n variables, defined on domains of size at most d, and a set of e binary constraints. The binary constraint satisfaction problem ...
151
click to vote
CP
2003
Springer
15 years 11 months ago
2003
Springer
Incomplete decision algorithms can often solve larger problem instances than complete ones. The drawback is that one does not know whether the algorithm will finish soon, later, ...
165
click to vote
ESA
2003
Springer
15 years 11 months ago
2003
Springer
In ad-hoc wireless networks, certain network connectivity constraints are of interest because of their practical importance. An example of such a constraint would be strong connec...
182
click to vote
ESERNET
2003
Springer
15 years 11 months ago
2003
Springer
The origin of the study described here is the experiment performed by Basili and Selby, further replicated by Kamsties and Lott, and once again by Wood et al. These experiments inv...
173
click to vote
EUROPAR
2003
Springer
15 years 11 months ago
2003
Springer
Partial redundancy elimination (PRE) techniques play an important role in optimizing compilers. Many optimizations, such as elimination of redundant expressions, communication opti...