945 search results - page 67 / 189 » Incremental Branching Programs |
IJON
2006
13 years 9 months ago
2006
Constructing the controller of a mobile robot has several issues to be addressed: how to automate behavior generation procedure, how to insert available domain knowledge effective...
ICCSA
2004
Springer
14 years 2 months ago
2004
Springer
The algorithmic techniques which allow high efficiency in the precise calculation of the reliability of an undirected graph with absolutely reliable nodes and unreliable edges are ...
ICSM
1997
IEEE
14 years 1 months ago
1997
IEEE
ÐWe describe a general technique for identifying modules in legacy code. The method is based on concept analysisÐa branch of lattice theory that can be used to identify similarit...
AI
2010
Springer
13 years 9 months ago
2010
Springer
The subgraph isomorphism problem involves deciding if there exists a copy of a pattern graph in a target graph. This problem may be solved by a complete tree search combined with ...
AI
2002
Springer
13 years 9 months ago
2002
Springer
Hex is a beautiful game with simple rules and a strategic complexity comparable to that of Chess and Go. The massive game-tree search techniques developed mostly for Chess and suc...