Probabilistic (or randomized) decision trees can be used to compute Boolean functions. We consider two types of probabilistic decision trees - one has a certain probability to give...
Laura Mancinska, Maris Ozols, Ilze Dzelme-Berzina,...
In a collaborative session users may join and leave. A user who joins a session is called a latecomer. A latecomer needs the current state of the collaborative session to participa...
The resource constraint project scheduling problem (RCPSP) is an NP-hard benchmark problem in scheduling which takes into account the limitation of resources’ availabilities in ...
Until now, system administrators have lacked a flexible real-time network traffic flow monitoring package. Such a package must provide a wide range of services but remain flexible ...
David Moore, Ken Keys, Ryan Koga, Edouard Lagache,...
This paper discusses new mobile usage scenarios for WLAN technologies and presents an architecture that is based on the notion of intermittent connectivity instead of seamless con...