635 search results - page 121 / 127 » Some Computational Problems Related to Pseudo-intents |
SAC
2006
ACM
14 years 4 months ago
2006
ACM
This paper studies ways for modularizing transformation definitions in current rule-based model transformation languages. Two scenarios are shown in which the modular units are id...
CASSIS
2005
Springer
14 years 4 months ago
2005
Springer
Today many interactions are carried out online through Web sites and e-services and often private and/or sensitive information is required by service providers. A growing concern r...
COCO
2005
Springer
14 years 4 months ago
2005
Springer
We prove that if NP ⊆ BPP, i.e., if SAT is worst-case hard, then for every probabilistic polynomial-time algorithm trying to decide SAT, there exists some polynomially samplable ...
AMAI
2004
Springer
14 years 4 months ago
2004
Springer
This paper extends the framework of partially observable Markov decision processes (POMDPs) to multi-agent settings by incorporating the notion of agent models into the state spac...
GECCO
2003
Springer
14 years 4 months ago
2003
Springer
The development of the XCS Learning Classifier System [26] has produced a stable implementation, able to consistently identify the accurate and optimally general population of cla...