3656 search results - page 285 / 732 » Compact Location Problems |
151
click to vote
GECCO
2006
Springer
15 years 10 months ago
2006
Springer
In this paper we set the first steps towards the development of a commercially viable tool that uses evolutionary computation to address the Product to Shelf Allocation Problem (P...
182
click to vote
ESA
2008
Springer
15 years 8 months ago
2008
Springer
For several NP-hard network design problems, the best known approximation algorithms are remarkably simple randomized algorithms called Sample-Augment algorithms in [11]. The algor...
198
click to vote
CDC
2009
IEEE
15 years 7 months ago
2009
IEEE
Abstract-- An inverse modeling problem for systems governed by first-order, hyperbolic partial differential equations subject to periodic forcing is investigated. The problem is de...
168
click to vote
CN
2010
15 years 6 months ago
2010
We consider massively dense ad hoc networks and study their continuum limits as the node density increases and as the graph providing the available routes becomes a continuous area...
409
click to vote
CVPR
2009
IEEE
17 years 1 months ago
2009
IEEE
The problem of recognizing actions in realistic videos
is challenging yet absorbing owing to its great potentials
in many practical applications. Most previous research is
limit...