2957 search results - page 357 / 592 » The Complexity of Polynomial-Time Approximation |
141
click to vote
GECCO
2006
Springer
15 years 10 months ago
2006
Springer
In this article, new variation operators for evolutionary multiobjective algorithms (EMOA) are proposed. On the basis of a predator-prey model theoretical considerations as well a...
175
click to vote
CLUSTER
2001
IEEE
15 years 10 months ago
2001
IEEE
In this paper, we revisit the master-slave tasking paradigm in the context of heterogeneous processors. We assume that communications take place in exclusive mode. We present a po...
182
click to vote
RT
2000
Springer
15 years 10 months ago
2000
Springer
We propose solutions for seamlessly integrating synthetic objects into background photographs at interactive rates. Recently developed image-based methods are used to capture real...
169
click to vote
COSIT
1995
Springer
15 years 10 months ago
1995
Springer
: Various algorithms have been proposed for the determination of the optimum paths in line networks. Moving in space is a far more complex problem, where research has been scarce. ...
164
click to vote
ACL
2008
15 years 8 months ago
2008
In lexicalized grammatical formalisms, it is possible to separate lexical category assignment from the combinatory processes that make use of such categories, such as parsing and ...