444 search results - page 43 / 89 » Termination by Abstraction |
ESA
2008
Springer
13 years 10 months ago
2008
Springer
Abstract. We study two-stage robust variants of combinatorial optimization problems like Steiner tree, Steiner forest, and uncapacitated facility location. The robust optimization ...
ICCAD
1999
IEEE
14 years 1 months ago
1999
IEEE
A delay abstraction of a combinational module is a compact representation of the delay information of the module, which carries effective pin-to-pin delay for each primary-input/pr...
ICC
2007
IEEE
14 years 28 days ago
2007
IEEE
Abstract-- As the distance between terminals in modern wireless networks tends to decrease, the energy consumption issue, conventionally assumed to be exclusively dominated by the ...
CSL
2004
Springer
14 years 2 months ago
2004
Springer
Abstract. For nested or heterogeneous datatypes, terminating recursion schemes considered so far have been instances of iteration, excluding efficient definitions of fixed-point ...
TIT
2008
13 years 9 months ago
2008
Abstract-- The common problem of a nomadic terminal sending information to a remote destination via agents with lossless connections is investigated. Such a setting suits, e.g. acc...