241 search results - page 38 / 49 » Constraint Handling in Genetic Algorithms: The Set Partition... |
CGO
2011
IEEE
12 years 11 months ago
2011
IEEE
—Approximating ideal program outputs is a common technique for solving computationally difficult problems, for adhering to processing or timing constraints, and for performance ...
INFOCOM
2006
IEEE
14 years 1 months ago
2006
IEEE
— For many wireless communication links, such as those employing turbo codes or sequentially-decoded convolutional codes, the power consumption of the decoder at the receiver dep...
ASPDAC
2000
ACM
13 years 12 months ago
2000
ACM
Global placement of hypergraphs is critical in the top-down placement of large timing-driven designs 10, 16 . Placement quality is evaluated in terms of the half-perimeter wirelen...
ICPADS
2007
IEEE
14 years 1 months ago
2007
IEEE
In this paper, we address one of the Wireless Sensor Network (WSN) management problems – optimization on the execution of multiple commands. The objective of the paper is to pro...
ACMICEC
2007
ACM
13 years 11 months ago
2007
ACM
This paper presents a decentralized task allocation method that can handle allocation of tasks with time and precedence constraints in a multi-agent setting where not all informat...