2055 search results - page 58 / 411 » Generic Model Refactorings |
AML
2010
15 years 1 months ago
2010
We give some restrictions for the search for a model of the club principle with no Souslin trees. We show that (2, [], is almost constant on) together with CH and "all Aronsza...
ICES
2007
Springer
15 years 3 months ago
2007
Springer
Combinational multipliers represent a class of circuits that is usually considered to be hard to design by means of the evolutionary techniques. However, experiments conducted unde...
115
click to vote
ASIACRYPT
2008
Springer
15 years 3 months ago
2008
Springer
Abstract. The generic (aka. black-box) group model is a valuable methodology for analyzing the computational hardness of number-theoretic problems used in cryptography. Since the p...
113
click to vote
OTM
2010
Springer
15 years 2 days ago
2010
Springer
In this paper, we present generic algorithms to ensure the consistency of mutual-exclusion and binding constraints in a business process context. We repeatedly identified the need...
KCAP
2003
ACM
15 years 7 months ago
2003
ACM
In this paper we describe a generic library of problemsolving methods (PSMs) for scheduling applications. Although, some attempts have been made in the past at developing librarie...