Sciweavers

499 search results - page 39 / 100
» Why neighbor-joining works
Sort
View
APN
2004
Springer
14 years 3 months ago
Reachability Set Generation for Petri Nets: Can Brute Force Be Smart?
Generating the reachability set is one of the most commonly required step when analyzing the logical or stochastic behavior of a system modeled with Petri nets. Traditional “expl...
Gianfranco Ciardo
ECML
2004
Springer
14 years 3 months ago
Convergence and Divergence in Standard and Averaging Reinforcement Learning
Although tabular reinforcement learning (RL) methods have been proved to converge to an optimal policy, the combination of particular conventional reinforcement learning techniques...
Marco Wiering
GECCO
2004
Springer
107views Optimization» more  GECCO 2004»
14 years 3 months ago
An Evolution Strategy Using a Continuous Version of the Gray-Code Neighbourhood Distribution
Abstract. We derive a continuous probability distribution which generates neighbours of a point in an interval in a similar way to the bitwise mutation of a Gray code binary string...
Jonathan E. Rowe, Dzena Hidovic
HICSS
2003
IEEE
134views Biometrics» more  HICSS 2003»
14 years 3 months ago
User Centred Opportunities for Supporting Consumer Behaviour Through Handheld and Ubiquitous Computing
Moving around our physical environment, we are surrounded and interact with information that exhorts and stimulates us to buy things. For most of us, not all of these impulses are...
Kenton O'Hara, Mark Perry
IRAL
2003
ACM
14 years 3 months ago
Question-Answering based on virtually integrated lexical knowledge base
This paper proposes an algorithm for causality inference based on a set of lexical knowledge bases that contain information about such items as event role, is-a hierarchy, relevan...
Key-Sun Choi, Jae-Ho Kim, Masaru Miyazaki, Jun Got...