112 search results - page 13 / 23 » Handling Preprocessor-Conditioned Declarations |
PARA
2000
Springer
15 years 3 months ago
2000
Springer
Our proposal has the following key features: 1) The separation of a distributed program into a pure algorithm (PurAl) and a distribution/communication declaration (DUAL). This yie...
106
click to vote
JASIS
2000
14 years 11 months ago
2000
s In data mining, we emphasize the need for learning from huge, incomplete and imperfect data sets (Fayyad et al. 1996, Frawley et al. 1991, Piatetsky-Shapiro and Frawley, 1991). T...
CAV
2009
Springer
16 years 5 days ago
2009
Springer
We describe a Markov chain Monte Carlo (MCMC)-based algorithm for sampling solutions to mixed Boolean/integer constraint problems. The focus of this work differs in two points from...
100
click to vote
MKM
2007
Springer
15 years 5 months ago
2007
Springer
An axiomatic theory represents mathematical knowledge declaratively as a set of axioms. An algorithmic theory represents mathematical knowledge procedurally as a set of algorithms....
SOCASE
2007
Springer
15 years 5 months ago
2007
Springer
Abstract. This paper contributes to a line of research that aims to apply agent-oriented techniques in the field of service-oriented computing. In particular, we propose to use go...