1132 search results - page 79 / 227 » Upper and lower Ramsey bounds in bounded arithmetic |
170
click to vote
JSAC
2006
15 years 6 months ago
2006
We consider the problem of traffic grooming in WDM path, star, and tree networks. Traffic grooming is a variant of the well-known logical topology design, and is concerned with the...
141
click to vote
ICRA
2008
IEEE
16 years 24 days ago
2008
IEEE
— This paper relates 5 observability indexes for robot calibration to the “alphabet optimalities” from the experimental design literature. These 5 observability indexes are s...
165
click to vote
PE
2010
Springer
15 years 4 months ago
2010
Springer
We analyze the capacity scaling laws of wireless networks where the spatial distribution of nodes over the network area exhibits a high degree of clustering. In particular we cons...
185
click to vote
WAOA
2007
Springer
16 years 14 days ago
2007
Springer
For a connected graph G, let L(G) denote the maximum number of leaves in a spanning tree in G. The problem of computing L(G) is known to be NP-hard even for cubic graphs. We improv...
121
click to vote
MST
2006
15 years 6 months ago
2006
We study a popular pencil-and-paper game called morpion solitaire. We present upper and lower bounds for the maximum score attainable for many versions of the game. We also show t...