13306 search results - page 390 / 2662 » Theoretical Computer Science |
156
click to vote
STACS
1999
Springer
15 years 11 months ago
1999
Springer
Abstract. In this we paper we consider the version of the classical Towers of Hanoi games where the game-board contains more than three pegs. For k pegs we give a 2Ckn1/(k−2) low...
163
click to vote
FOCS
1991
IEEE
15 years 10 months ago
1991
IEEE
A polygon with two distinguished vertices, s and g, is called a street iff the two boundary chains from s to g are mutually weakly visible. For a mobile robot with on-board vision...
138
click to vote
ACMSE
2008
ACM
15 years 8 months ago
2008
ACM
In this paper we present a framework for rapid prototyping of airplane designs as an example of the benefits of integrating simulation, gaming, and design interfaces into a cohesi...
184
click to vote
ITICSE
2010
ACM
15 years 7 months ago
2010
ACM
Teaching wireless sensor networks (WSNs) at the undergraduate level is both challenging and rewarding. WSNs include low-level programming and debugging, power-aware operations, no...
169
click to vote
FOCS
2010
IEEE
15 years 4 months ago
2010
IEEE
We present a new algorithm for learning a convex set in n-dimensional space given labeled examples drawn from any Gaussian distribution. The complexity of the algorithm is bounded ...