252 search results - page 16 / 51 » On partitions of discrete boxes |
SIBGRAPI
2008
IEEE
14 years 2 months ago
2008
IEEE
This work proposes a simple approximation scheme for discrete data that leads to an infinitely smooth result without global optimization. It combines the flexibility of Binary Sp...
COMPGEOM
2006
ACM
14 years 1 months ago
2006
ACM
We consider the problem of balancing the load among m service-providing facilities, while keeping the total cost low. Let R be the underlying demand region, and let p1, . . . , pm...
CORR
2007
Springer
13 years 7 months ago
2007
Springer
The Steiner tree problem is a classical NP-hard optimization problem with a wide range of practical applications. In an instance of this problem, we are given an undirected graph ...
JGO
2010
13 years 6 months ago
2010
Abstract. Global optimization seeks a minimum or maximum of a multimodal function over a discrete or continuous domain. In this paper, we propose a hybrid heuristic – based on th...
CDC
2008
IEEE
13 years 9 months ago
2008
IEEE
Abstract-- The aim of this paper is to address left invertibility for dynamical systems with inputs and outputs in discrete sets. We study systems that evolve in discrete time with...