4451 search results - page 422 / 891 » On Random Ordering Constraints |
181
Voted
JSYML
2007
15 years 6 months ago
2007
We consider embeddings of structures which preserve spectra: if g : M → S with S computable, then M should have the same Turing degree spectrum (as a structure) that g(M) has (a...
206
Voted
WWW
2009
ACM
16 years 7 months ago
2009
ACM
The run-time binding of web services has been recently put forward in order to support rapid and dynamic web service compositions. With the growing number of alternative web servi...
181
Voted
ICCAD
2004
IEEE
16 years 3 months ago
2004
IEEE
—In this paper, we present a new block budgeting algorithm which speeds up timing closure in timing driven hierarchical flows. After a brief description of the addressed flow, ...
174
Voted
CPAIOR
2009
Springer
16 years 1 months ago
2009
Springer
In this abstract, we present a rule-based modelling language for constraint programming, called Rules2CP [1], and a library PKML for modelling packing problems. Unlike other modell...
191
Voted
ISSTA
2009
ACM
16 years 1 months ago
2009
ACM
Dynamic test generation consists of executing a program while gathering symbolic constraints on inputs from predicates encountered in branch statements, and of using a constraint ...