4679 search results - page 177 / 936 » Modeling When Connections Are the Problem |
127
click to vote
OPODIS
2007
15 years 6 months ago
2007
Abstract. Blin et al. (2006) proposed a distributed protocol that enables the smallest number of searchers to clear any unknown asynchronous graph in a decentralized manner. Unknow...
147
click to vote
JMLR
2006
15 years 5 months ago
2006
Several fundamental security mechanisms for restricting access to network resources rely on the ability of a reference monitor to inspect the contents of traffic as it traverses t...
172
click to vote
IROS
2009
IEEE
15 years 12 months ago
2009
IEEE
— Partially Observable Markov Decision Processes (POMDPs) provide a rich mathematical model to handle realworld sequential decision processes but require a known model to be solv...
142
click to vote
TIT
2002
15 years 4 months ago
2002
Abstract--Two-dimensional interleaving schemes with repetitions are considered. These schemes are required for the correction of two-dimensional bursts (or clusters) of errors in a...
148
click to vote
ASP
2001
Springer
15 years 9 months ago
2001
Springer
In this paper bounded model checking of asynchronous concurrent systems is introduced as a promising application area for answer set programming. This is an extension of earlier w...