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...
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...
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...
Qingfang Wu, Mohammad Rafiee, Andrew Tinka, Alexan...
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...
Alonso Silva, Eitan Altman, Pierre Bernhard, M&eac...
The increasing availability of space-time trajectories left by location-aware devices is expected to enable novel classes of applications where the discovery of consumable, concise...