784 search results - page 146 / 157 » Relaxing the Value Restriction |
CIE
2007
Springer
14 years 1 months ago
2007
Springer
Abstract. The input to a constraint satisfaction problem (CSP) consists of a set of variables, each with a domain, and constraints between these variables formulated by relations o...
OTM
2007
Springer
14 years 1 months ago
2007
Springer
In recent years, existing computing schemes and paradigms have evolved towards more flexible, ad-hoc scalable frameworks. Nowadays, exchanging interactions between entities often ...
APLAS
2006
ACM
14 years 1 months ago
2006
ACM
Abstract. The Scheme language report advocates language design as the composition of a small set of orthogonal constructs, instead of a large accumulation of features. In this pape...
PODC
2006
ACM
14 years 1 months ago
2006
ACM
We study the problem of maintaining sketches of recent elements of a data stream. Motivated by applications involving network data, we consider streams that are asynchronous, in w...
ASPDAC
2005
ACM
14 years 1 months ago
2005
ACM
With impressive progress in Boolean Satisfiability (SAT) solving and several extensions to pseudo-Boolean (PB) constraints, many applications that use SAT, such as highperformanc...