352 search results - page 40 / 71 » On the optimal reachability problem of weighted timed automa... |
ICRA
2008
IEEE
14 years 2 months ago
2008
IEEE
— This paper focuses on the assignment of discrete points to two robots, in the presence of geometric and kinematic constraints between the robots. The individual points have dif...
TNN
2008
13 years 7 months ago
2008
Blind inversion of a linear and instantaneous mixture of source signals is a problem often encountered in many signal processing applications. Efficient FastICA (EFICA) offers an ...
SODA
1996
ACM
13 years 9 months ago
1996
ACM
Given a convex polygon P with m vertices and a set S of n points in the plane, we consider the problem of nding a placement of P that contains the maximum number of points in S. W...
GECCO
2005
Springer
14 years 1 months ago
2005
Springer
Among the many codings of spanning trees for evolutionary search are those based on bijections between Pr¨ufer strings—strings of n−2 vertex labels—and spanning trees on th...
GECCO
2005
Springer
14 years 1 months ago
2005
Springer
Any computational approach to design, including the use of evolutionary algorithms, requires the transformation of the domain-specific knowledge into a formal design representatio...