2981 search results - page 431 / 597 » Answer Set Planning |
154
click to vote
FOCS
2008
IEEE
16 years 26 days ago
2008
IEEE
We consider the problem of online sublinear expander reconstruction and its relation to random walks in “noisy” expanders. Given access to an adjacency list representation of ...
142
click to vote
ICDM
2008
IEEE
16 years 26 days ago
2008
IEEE
In a typical realistic scenario, there exist some past data about the structure of the network which are analyzed with respect to some possibly future spreading process, such as b...
165
click to vote
ICRA
2008
IEEE
16 years 25 days ago
2008
IEEE
— In legged systems design an important question applies to: "What can be inferred from the performance of a legged robot of a similarly configured system, but scaled to a s...
183
click to vote
INFOCOM
2008
IEEE
16 years 25 days ago
2008
IEEE
Abstract—We study the throughput capacity of wireless networks which employ (asynchronous) random-access scheduling as opposed to deterministic scheduling. The central question w...
152
click to vote
LICS
2008
IEEE
16 years 24 days ago
2008
IEEE
We study the classes of B¨uchi and Rabin automatic structures. For B¨uchi (Rabin) automatic structures their domains consist of infinite strings (trees), and the basic relation...