640 search results - page 75 / 128 » Discovering State Invariants |
ESANN
2007
15 years 1 months ago
2007
Training recurrent neural networks is hard. Recently it has however been discovered that it is possible to just construct a random recurrent topology, and only train a single linea...
AAAI
2006
15 years 1 months ago
2006
Markov decision processes (MDPs) with discrete and continuous state and action components can be solved efficiently by hybrid approximate linear programming (HALP). The main idea ...
ECAI
2010
Springer
15 years 29 days ago
2010
Springer
Nested Monte-Carlo search is a general algorithm that gives good results in single player games. Genetic Programming evaluates and combines trees to discover expressions that maxim...
104
click to vote
ASWEC
2010
IEEE
15 years 2 days ago
2010
IEEE
—Reducing software complexity is key to reducing software maintenance costs. To discover complexity-reducing practices, in this paper we study the evolution of seven sizable open...
101
click to vote
JODS
2007
14 years 11 months ago
2007
We view match as an operator that takes two graph-like structures (e.g., classifications, XML schemas) and produces a mapping between the nodes of these graphs that correspond sema...