1998 search results - page 279 / 400 » Complexity of the Cover Polynomial |
91
Voted
KBSE
2007
IEEE
15 years 7 months ago
2007
IEEE
Software compatibility testing is an important quality assurance task aimed at ensuring that component-based software systems build and/or execute properly across a broad range of...
113
click to vote
KBSE
2007
IEEE
15 years 7 months ago
2007
IEEE
Achieving high structural coverage such as branch coverage in objectoriented programs is an important and yet challenging goal due to two main challenges. First, some branches inv...
105
click to vote
IPPS
2006
IEEE
15 years 6 months ago
2006
IEEE
Wireless mesh networks recently emerge as a flexible, low-cost and multipurpose networking platform with wired infrastructure connected to the Internet. A critical issue in mesh ...
103
click to vote
WIDM
2003
ACM
15 years 6 months ago
2003
ACM
Query rewriting using views is an essential issue in data integration. A number of algorithms, e.g., the bucket algorithm, the inverse rules algorithm, the SVB algorithm and the M...
114
Voted
EVOW
2007
Springer
15 years 4 months ago
2007
Springer
RND (Radio Network Design) is a Telecommunication problem consisting in covering a certain geographical area by using the smallest number of radio antennas achieving the biggest co...