5100 search results - page 581 / 1020 » The Linear Complexity of a Graph |
150
click to vote
LPAR
1994
Springer
15 years 11 months ago
1994
Springer
The concept of anti-link is defined, and useful equivalence-preserving operations on propositional formulas based on anti-links are introduced. These operations eliminate a potent...
170
click to vote
EH
2004
IEEE
15 years 10 months ago
2004
IEEE
Multi Expression Programming (MEP) is a Genetic Programming (GP) variant that uses linear chromosomes for solution encoding. A unique MEP feature is its ability of encoding multipl...
199
click to vote
AMDO
2008
Springer
15 years 8 months ago
2008
Springer
Abstract. In this paper we propose an original approach to solve the Inverse Kinematics problem. Our framework is based on Sequential Monte Carlo Methods and has the advantage to a...
177
click to vote
CIE
2008
Springer
15 years 8 months ago
2008
Springer
We revisit the deterministic graphical games of Washburn. A deterministic graphical game can be described as a simple stochastic game (a notion due to Anne Condon), except that we ...
152
click to vote
CSR
2008
Springer
15 years 8 months ago
2008
Springer
We define a denotational semantics for Light Affine Logic (LAL) which has the property that denotations of functions are polynomial time computable by construction of the model. Th...