8810 search results - page 469 / 1762 » Openness |
156
click to vote
SIAMDM
2010
15 years 5 months ago
2010
A connected graph G is called t-perfect if its stable set polytope is determined by the non-negativity, edge and odd-cycle inequalities. Moreover, G is called strongly t-perfect i...
151
click to vote
CG
2010
Springer
15 years 4 months ago
2010
Springer
Abstract. For the first time, automated Hex solvers have surpassed humans in their ability to solve Hex positions: they can now solve many 9
180
Voted
FECS
2010
15 years 4 months ago
2010
This paper describes the experience of teaching robotics at the freshman level, from the conception of the project through the offering of a computer science seminar in robotics, h...
172
click to vote
GLOBECOM
2010
IEEE
15 years 4 months ago
2010
IEEE
The concept of dynamic spectrum access (DSA) enables the licensed spectrum to be traded in an open market where the unlicensed users can freely buy and use the available licensed s...
188
click to vote
Publication
An ability to accurately classify observed packet errors according to their root cause: physical layer or MAC layer contention, in 802.11 networks, opens up many opportunities for ...