2796 search results - page 81 / 560 » The coolest path problem |
148
click to vote
DSN
2009
IEEE
15 years 11 months ago
2009
IEEE
Dynamic symbolic execution is a structural testing technique that systematically explores feasible paths of the program under test by running the program with different test input...
146
click to vote
ICNP
2007
IEEE
15 years 11 months ago
2007
IEEE
Abstract— We address the problem of identifying high throughput paths in 802.11 wireless mesh networks. We introduce an analytical model that accurately captures the 802.11 MAC p...
123
click to vote
APPT
2007
Springer
15 years 11 months ago
2007
Springer
We investigate the problem of constructing the maximal number of node disjoint paths between two distinct nodes in Swapped/OTIS networks. A general construction of node disjoint pa...
122
click to vote
ICRA
2006
IEEE
15 years 10 months ago
2006
IEEE
— Characterizing optimal paths for mobile robots is an interesting, important, and challenging endeavor. Not only they are interesting with respect to the optimized criteria, but...
124
click to vote
ICRA
2002
IEEE
15 years 9 months ago
2002
IEEE
Abstract— Tracked mobile robots in the 20 kg size class are under development for applications in urban reconnaissance. For efficient deployment, it is desirable for teams of ro...