The coding by which chromosomes represent candidate solutions is a fundamental design choice in a genetic algorithm. This paper describes a novel coding of spanning trees in a gen...
Abstract—We consider the problem of aggregation convergecast scheduling in wireless sensor networks. Aggregation convergecast differs from regular convergecast in that it accommo...
Baljeet Malhotra, Ioanis Nikolaidis, Mario A. Nasc...
Phrase-based decoding produces state-of-theart translations with no regard for syntax. We add syntax to this process with a cohesion constraint based on a dependency tree for the ...
This paper has two parts. First, we propose a method which can be used to decompose a geometric constraint graph into a c-tree. With this decomposition, solving for a well-constrai...
Abstract--This paper presents a solution to the problem of performance-driven buffered routing tree generation for VLSI circuits. Using a novel bottom-up construction algorithm and...