804 search results - page 52 / 161 » Solutions to Computational Problems Through Gene Assembly |
98
Voted
ISCI
2010
14 years 11 months ago
2010
In this work a new optimization method, called the heuristic Kalman algorithm (HKA), is presented. This new algorithm is proposed as an alternative approach for solving continuous,...
95
Voted
MOBIHOC
2001
ACM
16 years 8 days ago
2001
ACM
In this paper we consider the following problem for ad hoc networks: assume that n nodes are distributed in a d-dimensional region, with 1d3, and assume that all the nodes have th...
CCCG
1993
15 years 2 months ago
1993
A k-dense corridor through a finite set, S, of n points in the plane is the open region of the plane that is bounded by two parallel lines that intersect the convex hull of S and ...
112
click to vote
EVOW
2008
Springer
15 years 1 months ago
2008
Springer
Abstract. This contribution studies speciation from the standpoint of evolutionary robotics (ER). A common approach to ER is to design a robot’s control system using neuro-evolut...
147
click to vote
ICDCN
2011
Springer
14 years 4 months ago
2011
Springer
We address the problem of designing distributed algorithms for large scale networks that are robust to Byzantine faults. We consider a message passing, full information model: the ...