Ubiquitous is one of the essential features of what should be the desktop of the future. In practice, this concept covers several issues related to multi-users collaboration, remote applications control or remote display and secure access over IP networks. With its standards and capabilities, WebRTC provides a new vision of real-time communications services that can raise these challenges. In this paper we present a WebRTC-based middleware solution for real-time multi-users remote collaboration. It allows a full desktop setup where everyone can see what other users are doing and where they position themselves in the shared workspace. In contrast to standard WebRTC's Peer-to-Peer architecture, our system supports a synchronous communication model through a star topology. It also improves network bandwidth efficiency by using hardware video compression when the GPU resource is available, though assuring a very low latency streaming. In this way, we can maintain awareness and sense of presence without changing the usual practices of the users in front of a desktop. Several use cases are provided and a comparison of advantages and drawbacks of this solution is also presented to guide users in applying this technology under real-life conditions.
No abstract
In this paper, we present a generic hybrid algorithm for combining complete (constraint programming) and incomplete (local search) methods in order to solve constraint satisfaction problems. This algorithmic scheme uses constraint propagation techniques and local search heuristics over populations. The structures involved provide an harmonious interaction between the different methods, and also benefit from the respective methods' assets. We propose various combination strategies and emphasize their interest on some examples which are solved by means of an implementation. Résumé.Nous présentons dans cet article un algorithme générique hybride permettant de combiner des méthodes complètes (programmation par contraintes) et incomplètes (recherche locale) pour la résolution de problèmes de satisfaction de contraintes. Ce schéma algorithmique basé sur la gestion de populations, utilise des techniques de propagation de contraintes intégrantégalement des heuristiques de recherche locale. Les structures utilisées autorisent une interaction homogène entre les différentes méthodes mises en oeuvre et permettentégalement de bénéficier de leurs atouts respectifs. Nous proposons alors diverses stratégies de combinaisons dont nous mettons en avant l'intérêt sur quelques exemples par le biais d'une implémentation.Mots Clés. Satisfaction de contraintes, propagation de contraintes, méthodes de recherche hybride.
scite is a Brooklyn-based organization that helps researchers better discover and understand research articles through Smart Citations–citations that display the context of the citation and describe whether the article provides supporting or contrasting evidence. scite is used by students and researchers from around the world and is funded in part by the National Science Foundation and the National Institute on Drug Abuse of the National Institutes of Health.
hi@scite.ai
10624 S. Eastern Ave., Ste. A-614
Henderson, NV 89052, USA
Copyright © 2024 scite LLC. All rights reserved.
Made with 💙 for researchers
Part of the Research Solutions Family.