1698 search results - page 128 / 340 » Growing Complex Games |
130
click to vote
MOC
1998
15 years 3 months ago
1998
In this paper we propose an algorithm for evaluation of logarithms in the finite fields Fpn , where the number pn − 1 has a small primitive factor r. The heuristic estimate of ...
82
Voted
NN
1998
Springer
15 years 3 months ago
1998
Springer
Abstract— This paper presents a study on exploiting the redundancy of a seven-link manipulator to evolve obstacle avoidance skill at the elbow, subjected to endeffector working ...
125
click to vote
TIT
1998
15 years 3 months ago
1998
Abstract—A class of capacity-achieving, low-complexity, highreliability, variable-rate coding schemes is developed for communication over discrete memoryless channels with noisel...
114
click to vote
SODA
2010
ACM
15 years 2 months ago
2010
ACM
Star-shaped bodies are an important nonconvex generalization of convex bodies (e.g., linear programming with violations). Here we present an efficient algorithm for sampling a giv...
150
click to vote
IAT
2010
IEEE
15 years 2 months ago
2010
IEEE
As wireless sensor network applications grow in complexity, ad-hoc techniques are no longer adequate. Thus, it is crucial that these systems be adaptive and autonomous to remain f...