Sciweavers

2899 search results - page 451 / 580
» On the Complexity of Exclusion Algorithms for Optimization
Sort
View
FOCS
1997
IEEE
15 years 9 months ago
Beyond the Flow Decomposition Barrier
We introduce a new approach to the maximum flow problem. This approach is based on assigning arc lengths based on the residual flow value and the residual arc capacities. Our appro...
Andrew V. Goldberg, Satish Rao
AINA
2006
IEEE
15 years 7 months ago
Distributed Tuning Attempt Probability for Data Gathering in Random Access Wireless Sensor Networks
In this paper, we study the problem of data gathering in multi-hop wireless sensor networks. To tackle the high degree of channel contention and high probability of packet collisi...
Haibo Zhang, Hong Shen
145
Voted
ASAP
2006
IEEE
147views Hardware» more  ASAP 2006»
15 years 7 months ago
Reconfigurable Shuffle Network Design in LDPC Decoders
Several semi-parallel decoding architectures have been explored by researchers for the quasi-cyclic low density parity check (LDPC) codes. In these architectures, the reconfigurab...
Jun Tang, Tejas Bhatt, Vishwas Sundaramurthy
143
Voted
CEC
2007
IEEE
15 years 7 months ago
Fitness inheritance in evolutionary and multi-objective high-level synthesis
Abstract—The high-level synthesis process allows the automatic design and implementation of digital circuits starting from a behavioral description. Evolutionary algorithms are v...
Christian Pilato, Gianluca Palermo, Antonino Tumeo...
152
Voted
CCCG
2007
15 years 6 months ago
Covering Points by Isothetic Unit Squares
Given a set P of n points in R2 , we consider two related problems. Firstly, we study the problem of computing two isothetic unit squares which may be either disjoint or intersect...
Priya Ranjan Sinha Mahapatra, Partha P. Goswami, S...