2629 search results - page 118 / 526 » complex 2009 |
115
click to vote
IWOCA
2009
Springer
15 years 7 months ago
2009
Springer
We develop a method for performing boolean convolutions efficiently in word RAM model of computation, having a word size of w = Ω(log n) bits, where n is the input size. The tech...
126
Voted
KI
2009
Springer
15 years 7 months ago
2009
Springer
As a tractable description logic, DL-Lite provides a good compromise between expressive power and computational complexity of inference. It is therefore important to study ways of ...
89
Voted
MIG
2009
Springer
15 years 7 months ago
2009
Springer
Abstract. We present a system for automatically evolving neural networks as physics-based locomotion controllers for humanoid characters. Our approach provides two key features: (a...
117
click to vote
SAGA
2009
Springer
15 years 7 months ago
2009
Springer
Stochastic programming problems appear as mathematical models for optimization problems under stochastic uncertainty. Most computational approaches for solving such models are base...
119
click to vote
INTERACTION
2009
ACM
15 years 7 months ago
2009
ACM
In this paper, we introduce a novel binary method for fast computation of an objective function to measure inter and intra class similarities, which is used for combining multiple...