7522 search results - page 317 / 1505 » Spacing memetic algorithms |
218
click to vote
CGO
2011
IEEE
14 years 10 months ago
2011
IEEE
—Approximating ideal program outputs is a common technique for solving computationally difficult problems, for adhering to processing or timing constraints, and for performance ...
172
click to vote
ICRA
2000
IEEE
15 years 10 months ago
2000
IEEE
By exploiting properties of the joint space mass-inertia matrix of flexure jointed hexapods, a new decoupling method is proposed. The new decoupling method, through a static input...
189
click to vote
COMPGEOM
2006
ACM
16 years 22 days ago
2006
ACM
We present an optimal-time algorithm for computing (an implicit representation of) the shortest-path map from a fixed source s on the surface of a convex polytope P in three dime...
181
click to vote
SPAA
2003
ACM
16 years 13 hour ago
2003
ACM
An ad hoc network is a collection of wireless mobile hosts forming a temporary network without the aid of any fixed infrastructure. Indeed, an important task of an ad hoc network...
182
click to vote
COMPGEOM
2009
ACM
16 years 1 months ago
2009
ACM
Given a set system (X, R), the hitting set problem is to find a smallest-cardinality subset H ⊆ X, with the property that each range R ∈ R has a non-empty intersection with H...