693 search results - page 32 / 139 » Complexity Analysis of Heuristic CSP Search Algorithms |
113
click to vote
ISCC
2008
IEEE
15 years 8 months ago
2008
IEEE
We propose efficient scheduling algorithms for downlink MIMO-CDMA systems using zero forcing beamforming to achieve high system throughput with low computational complexity. Base...
112
Voted
CP
2003
Springer
15 years 7 months ago
2003
Springer
Abstract. This paper offers a critique of the framework of Constraint Satisfaction Problems. While this framework has been successful in studying search techniques, and has inspire...
116
Voted
ICDAR
2005
IEEE
15 years 7 months ago
2005
IEEE
In the field of computer analysis of document images, the problems of physical and logical layout analysis have been approached through a variety of heuristic, rule-based, and gr...
95
Voted
ISM
2006
IEEE
15 years 8 months ago
2006
IEEE
We consider Multimedia applications where clients specify a minimum desired stream rate (quality) and a time till when they are willing to wait, termed delay tolerance. The Conten...
110
click to vote
CSC
2008
15 years 3 months ago
2008
- The set-covering problem is an interesting problem in computational complexity theory. In [1], the setcovering problem has been proved to be NP hard and a greedy heuristic algori...