Sciweavers

845 search results - page 153 / 169
» Connecting Many-Sorted Theories
Sort
View
TOPLAS
2008
81views more  TOPLAS 2008»
13 years 8 months ago
Size-change termination with difference constraints
lem of inferring termination from such abstract information is not the halting problem for programs and may well be decidable. If this is the case, the decision algorithm forms a &...
Amir M. Ben-Amram

Publication
303views
12 years 6 months ago
Evolutionary synthesis of analog networks
he significant increase in the available computational power that took place in recent decades has been accompanied by a growing interest in the application of the evolutionary ap...
Claudio Mattiussi
MOBIHOC
2004
ACM
14 years 8 months ago
Localized algorithms for energy efficient topology in wireless ad hoc networks
We propose several novel localized algorithms to construct energy efficient routing structures for homogeneous wireless ad hoc networks, where all nodes have same maximum transmis...
Wen-Zhan Song, Yu Wang 0003, Xiang-Yang Li
APPROX
2007
Springer
77views Algorithms» more  APPROX 2007»
14 years 2 months ago
High Entropy Random Selection Protocols
We study the two party problem of randomly selecting a string among all the strings of length n. We want the protocol to have the property that the output distribution has high en...
Harry Buhrman, Matthias Christandl, Michal Kouck&y...
DIALM
2003
ACM
175views Algorithms» more  DIALM 2003»
14 years 1 months ago
Localized construction of bounded degree and planar spanner for wireless ad hoc networks
We propose a novel localized algorithm that constructs a bounded degree and planar spanner for wireless ad hoc networks modeled by unit disk graph (UDG). Every node only has to kn...
Yu Wang 0003, Xiang-Yang Li