Sciweavers

170 search results - page 9 / 34
» Minimizing Weighted Tree Grammars Using Simulation
Sort
View
ASPDAC
2000
ACM
154views Hardware» more  ASPDAC 2000»
15 years 1 months ago
Dynamic weighting Monte Carlo for constrained floorplan designs in mixed signal application
Simulated annealing has been one of the most popular stochastic optimization methods used in the VLSI CAD field in the past two decades for handling NP-hard optimization problems...
Jason Cong, Tianming Kong, Faming Liang, Jun S. Li...
APPROX
2008
Springer
245views Algorithms» more  APPROX 2008»
14 years 11 months ago
Approximating Optimal Binary Decision Trees
Abstract. We give a (ln n + 1)-approximation for the decision tree (DT) problem. An instance of DT is a set of m binary tests T = (T1, . . . , Tm) and a set of n items X = (X1, . ....
Micah Adler, Brent Heeringa
80
Voted
WASA
2009
Springer
107views Algorithms» more  WASA 2009»
15 years 4 months ago
Relative Span Weighted Localization of Uncooperative Nodes in Wireless Networks
Abstract. Increasingly ubiquitous wireless technologies require novel localization techniques to pinpoint the position of an uncooperative node, whether the target be a malicious d...
Christine Laurendeau, Michel Barbeau
AUTONOMICS
2008
ACM
14 years 11 months ago
Building multicast trees in ad-hoc networks
Multicast trees are used in a variety of applications, such as publish/subscribe systems or content distribution networks. Existing algorithms for ad-hoc networks typically produc...
Raphaël Kummer, Peter G. Kropf, Pascal Felber
SODA
2008
ACM
104views Algorithms» more  SODA 2008»
14 years 11 months ago
Fast and reliable reconstruction of phylogenetic trees with very short edges
Abstract Ilan Gronau Shlomo Moran Sagi Snir Phylogenetic reconstruction is the problem of reconstructing an evolutionary tree from sequences corresponding to leaves of that tree. ...
Ilan Gronau, Shlomo Moran, Sagi Snir