Abstract: A method and system are presented for configuring a search algorithm for solving a combinatorial optimization problem. The search algorithm has a number of procedural components. Each procedural component is configured using a respective data structure. The data structure has a tree structure, including traversal split nodes, each of which represents a choice to be made when configuring the procedural component of the search algorithm. Configuring the procedural component corresponds to traversing the tree structure, and the traversal is performed automatically. At each of the traversal split nodes, the choice of which direction to take through the tree structure is made randomly, using a respective probabilistic function. Thus, a population of candidate algorithms is generated. These are evaluated, and the probabilistic functions modified.
Type:
Grant
Filed:
December 22, 2006
Date of Patent:
April 21, 2015
Assignees:
Singapore Technologies Dynamics Ptd Ltd., Nanyang Technological University
Inventors:
Meng Hiot Lim, Yi Liang Xu, Yew Soon Ong
Abstract: A method for transmitting data between first and second nodes in a network comprises (a) the first node sending a start packet to the second node, (b) the first node starting a first counter concurrently with sending the start packet, wherein the first counter starts counting, (c) the second node starting a timer in response to the start packet, (d) the second node starting a second counter in response to the timer running for a predetermined delay time, wherein the second counter starts counting, (e) the first node stopping the first counter and sending a stop packet in response to the first node determining that the number of accumulated first counts corresponds to the data (thereby transmitting the data solely as a time interval between the start and stop packets), the second node stopping the second counter in response to the stop packet (and receiving the transmitted data).