Sciweavers

3367 search results - page 214 / 674
» Incremental assignment problem
Sort
View
198
Voted
MFCS
2010
Springer
15 years 2 months ago
Solving minones-2-sat as Fast as vertex cover
The problem of finding a satisfying assignment for a 2-SAT formula that minimizes the number of variables that are set to 1 (min ones 2–sat) is NP-complete. It generalizes the w...
Neeldhara Misra, N. S. Narayanaswamy, Venkatesh Ra...
116
Voted
CGO
2007
IEEE
15 years 10 months ago
On the Complexity of Register Coalescing
Memory transfers are becoming more important to optimize, for both performance and power consumption. With this goal in mind, new register allocation schemes are developed, which ...
Florent Bouchez, Alain Darte, Fabrice Rastello
129
Voted
VL
2007
IEEE
15 years 10 months ago
Evaluating an Automated Tool to Assist Evolutionary Document Generation
While using how-to documents for guidance in performing computer-based tasks, users often run into problems due to inaccurate, out-of-date and incomplete documentation. These prob...
Gahgene Gweon, Lawrence D. Bergman, Vittorio Caste...
136
Voted
PIMRC
2008
IEEE
15 years 10 months ago
Radio resource allocation in OFDMA multihop cellular cooperative networks
Multihop cellular networks (MeNs) is an extension of single hop cellular networks (SCNs) having benefits of a fixed base station and flexible ad hoc networks. The radio resource ma...
Cheol Jeong, Hyung-Myung Kim
178
Voted
BROADNETS
2006
IEEE
15 years 7 months ago
Spare Capacity Provisioning for Dynamic Traffic Grooming in Optical Networks
Abstract-- Optical Networks with wavelength routing are expected to form the backbone in the next generation wide area networks. The traffic grooming problem in optical networks is...
Shu Huang, Rudra Dutta