2244 search results - page 179 / 449 » A new heuristic approach for non-convex optimization problem... |
239
click to vote
ISPD
2012
ACM
14 years 2 months ago
2012
ACM
In this paper, we propose a new approach for gated bus synthesis [16] with minimum wire capacitance per transaction in three-dimensional (3D) ICs. The 3D IC technology connects di...
215
click to vote
EOR
2010
15 years 7 months ago
2010
Abstract: Probabilistically constrained problems, in which the random variables are finitely distributed, are nonconvex in general and hard to solve. The p-efficiency concept has b...
167
click to vote
POLICY
2007
Springer
16 years 1 months ago
2007
Springer
In this paper we describe an approach to the problem of automated policy generation for mobile ad hoc networks. The automated policy generation problem is difficult in its own rig...
187
click to vote
GECCO
2004
Springer
16 years 17 days ago
2004
Springer
The prize-collecting Steiner tree problem on a graph with edge costs and vertex profits asks for a subtree minimizing the sum of the total cost of all edges in the subtree plus th...
223
click to vote
AHSWN
2006
15 years 7 months ago
2006
Abstract-- We present a new, biologically-inspired algorithm for the problem of covering a given region with wireless "units" (sensors or base-stations). The general prob...