2989 search results - page 298 / 598 » Using Domain-Independent Problems for Introducing Formal Met... |
195
click to vote
KBSE
2008
IEEE
16 years 1 months ago
2008
IEEE
—Recent research results have shown more benefits of the management of code clones, rather than detecting and removing them. However, existing management approaches for code clo...
156
click to vote
GECCO
2006
Springer
15 years 10 months ago
2006
Springer
This paper investigates reinforcement learning (RL) in XCS. First, it formally shows that XCS implements a method of generalized RL based on linear approximators, in which the usu...
200
click to vote
IJFCS
2006
15 years 6 months ago
2006
We introduce the networks of Mealy multiset automata, and study their computational power. The networks of Mealy multiset automata are computationally complete. 1 Learning from Mo...
187
click to vote
ICTAI
2010
IEEE
15 years 4 months ago
2010
IEEE
We introduce a new plan repair method for problems cast as Mixed Integer Programs. In order to tackle the inherent complexity of these NP-hard problems, our approach relies on the ...
184
click to vote
DRM
2003
Springer
15 years 12 months ago
2003
Springer
In PODC 2003, Park, Chong, Siegel and Ray [22] proposed an optimistic protocol for fair exchange, based on RSA signatures. We show that their protocol is totally breakable already...