4212 search results - page 252 / 843 » On Compressible Pairings and Their Computation |
175
click to vote
GECCO
2007
Springer
16 years 25 days ago
2007
Springer
— In this paper, a parallel model of multi-objective genetic algorithm supposing a grid environment is discussed. In this proposed parallel model, we extended master-slave model ...
154
click to vote
COMPGEOM
2004
ACM
16 years 3 days ago
2004
ACM
We study the problem of computing the visibility graph defined by a set P of n points inside a polygon Q: two points p, q ∈ P are joined by an edge if the segment pq ⊂ Q. Ef...
170
click to vote
HAPTICS
2002
IEEE
15 years 11 months ago
2002
IEEE
: We present a six-degree-of-freedom haptic rendering algorithm using localized contact computations. It takes advantage of high motion coherence due to fast force update and spati...
185
click to vote
AINA
2007
IEEE
15 years 10 months ago
2007
IEEE
In ubiquitous computing environment, identification of objects and places in the real world is important, and 2-D printing code is useful to store identifiers of them. However, si...
155
click to vote
ALGORITHMICA
2006
15 years 6 months ago
2006
: We study the output-sensitive computations of all the combinations of the edges and vertices of a simple polygon P that allow a form closure grasp with less than four point conta...