810 search results - page 137 / 162 » Defining implicit objective functions for design problems |
AMAI
2000
Springer
13 years 11 months ago
2000
Springer
This paper proposes new algorithms for the Binate Covering Problem (BCP), a well-known restriction of Boolean Optimization. Binate Covering finds application in many areas of Comp...
GLOBECOM
2008
IEEE
14 years 2 months ago
2008
IEEE
- We design and implement various algorithms for solving the static RWA problem with the objective of minimizing the maximum number of requested wavelengths based on LP relaxation ...
SASO
2008
IEEE
14 years 2 months ago
2008
IEEE
—Spatial computing systems are characterized by the extended physical environment in which they exist and function. Often this environment can be manipulated in various ways by t...
IEEEPACT
2007
IEEE
14 years 2 months ago
2007
IEEE
Loop nest optimization is a combinatorial problem. Due to the growing complexity of modern architectures, it involves two increasingly difficult tasks: (1) analyzing the profita...
ICRA
2010
IEEE
13 years 6 months ago
2010
IEEE
— The DPC algorithm developed in our previous work is an efficient way of computing optimal trajectories for multiple robots in a distributed fashion with timeparameterized cons...