Demonstration venue · read-only. Every page can be browsed; the buttons that would change it are switched off. Create an account to run TaxoReview on your own data. A simulation from public publication records: the people listed were not invited and did not agree to review.
? Tutorial for this page

Pavel Troubil

dblp:58/453 · DBLP profile ↗
← Back
8ranked-venue papers
2as first author
2since 2021 · last 2026
0000-0002-0739-1177ORCID · corroborated

Domains — the database's venue-derived domains; a paper can count in several

Human-computer interaction and ubiquitous computing · 3Artificial intelligence and machine learning · 2 · 2 since 2021Graphics, computer vision, multimedia, augmented reality and games · 1 · 1 since 2021Applied, interdisciplinary, general and emerging computing · 1

Expertise — from the expertise taxonomy: the topics of the expert's papers under the CCF categories. A weight counts papers with recency: 1 for a paper about the topic, 0.3 when the topic is its context, halved every five years.

Theoretical computer science
1 paper
Mathematical optimization · 100%
Artificial intelligence
1 paper
Optimization for machine learning · 100%

Topics — the 3 heaviest of 3, each with the papers that count most for it

TopicWeightPapersLastEvidence papers
Machine learning › Optimization for machine learning › combinatorial optimization
neural combinatorial optimization
0.912025
Neural Combinatorial Optimization for Stochastic Flexible Job Shop Scheduling Problems · AAAI 2025
Mathematical optimization
combinatorial optimization
0.912025
Neural Combinatorial Optimization for Stochastic Flexible Job Shop Scheduling Problems · AAAI 2025
Mathematical optimization › scheduling
job shop scheduling
0.912025
Neural Combinatorial Optimization for Stochastic Flexible Job Shop Scheduling Problems · AAAI 2025

Methods — techniques the papers use, named apart from their topics

value-at-risk · 1.7neural combinatorial optimization · 1.7attention mechanism · 1.7
YearPublicationVenuePosition
2026 Towards Solving Polynomial-Objective Integer Programming with Hypergraph Neural Networks
Minshuo Li, Yaoxin Wu, Pavel Troubil, Yingqian Zhang 0001, Wim Nuijten
CPAIOR3
2025 Neural Combinatorial Optimization for Stochastic Flexible Job Shop Scheduling Problems
abstract
Neural combinatorial optimization (NCO) has gained significant attention due to the potential of deep learning to efficiently solve combinatorial optimization problems. NCO has been widely applied to job shop scheduling problems (JSPs) with the current focus predominantly on deterministic problems. In this paper, we propose a novel attention-based scenario processing module (SPM) to extend NCO methods for solving stochastic JSPs. Our approach explicitly incorporates stochastic information by an attention mechanism that captures the embedding of sampled scenarios (i.e., an approximation of stochasticity). Fed with the embedding, the base neural network is intervened by the attended scenarios, which accordingly learns an effective policy under stochasticity. We also propose a training paradigm that works harmoniously with either the expected makespan or Value-at-Risk objective. Results demonstrate that our approach outperforms existing learning and non-learning methods for the flexible JSP problem with stochastic processing times on a variety of instances. In addition, our approach holds significant generalizability to varied numbers of scenarios and disparate distributions.
Igor G. Smit, Yaoxin Wu, Pavel Troubil, Yingqian Zhang 0001, Wim Nuijten
AAAI3
2016 CoUnSiL: Collaborative Universe for Remote Interpreting of Sign Language in Higher Education
Vít Rusnák, Pavel Troubil, Svatoslav Ondra, Tomás Sklenák, Desana Daxnerová, Eva Hladká, Pavel Kajaba, Jaromír Kala, Matej Minárik, Peter Novák 0002, Christoph Damm
ICCHP (2)2
2014 Media Streams Planning with Uncertain Link Capacities
abstract
Interactive collaborative environments built upon high quality video applications require minimum capture-to-display latency to maintain feeling of natural communication. In practice, end users often encounter interruptions due to network congestion, which they could not avoid without knowledge of physical network infrastructure. We solve the problem of application level multipoint routing without assuming accurate knowledge of network link capacities, but rather relying on their estimates by network inference and bandwidth measurement tools. Our approach can handle uncertainties caused by both unreliable bandwidth measurements and unexpected capacity sharing. Support for on-the-fly transcoding of data streams on multicast agents allows per-recipient adaptation of video quality and bandwidth. We have implemented an ant colony optimization algorithm in the Co Universe middleware for orchestration of collaborative environments. Experiments show very good quality of results on most practical use cases and ability to solve significantly larger instances than optimal approaches based on mixed integer programming.
Pavel Troubil, Hana Rudová, Petr Holub
NCA1
2013 Media Streams Planning with Transcoding
abstract
High-quality video, both uncompressed and compressed with relatively low compression ratio, is used in interactive environments, where minimum end-to-end latency is required. The media streams planning solves multi-point data routing for such applications even when bit rate of streams is comparable to capacity of network links. Recent advances in acceleration of high-throughput low-latency video processing enable on-the-fly video transcoding even for 4K and 8K video streams, thus allowing individual adaptation of data stream for each recipient without affecting the others. Stimulated by these advances, we present a novel media streams planning with transcoding on network nodes, and a mixed integer programming approach to solve the problem optimally. Our approach also enhances traditional end-to-end network model of the whole system with known topology of certain network regions. Our solution was implemented in the Co Universe, which is middleware for orchestration of collaborative environments. Measurements show that performance of the new solver is sufficient for interactive solving of most practical use-cases, thus enabling self-organization of high-performance collaborative environments.
Pavel Troubil, Hana Rudová, Petr Holub
NCA1
2009 GColl group-to-group videoconferencing system: design and first experiences
abstract
We present a videoconferencing tool, GColl, which aims to support collaboration among remote groups of participants. GColl supports mutual gaze as well as partial gaze awareness for all participants, while still retaining a modest technical requirements: a camera and an echo-canceling microphone at
Petr Slovák, Pavel Troubil, Petr Holub
CollaborateCom2
2009 GColl: A Flexible Videoconferencing Environment for Group-to-Group Interaction
Petr Slovák, Pavel Troubil, Petr Holub
INTERACT (2)2
2007 Videoconferencing design for remote groups
abstract
Videoconferencing has emerged as a popular method of remote communication. The design of a videoconferencing environment strongly influences the communication efficiency and user satisfaction. Various studies on perceived effects of videoconferencing environments and their parameters have been done, however, they primarily focused on dyadic conversation. This paper describes an exploratory study on the effects on remote groups communication. Beginning with the standard environment, a videoconferencing design has been developed iteratively according to information obtained from the experimental group. Two new videoconferencing environment designs are introduced to suit the group conversation needs better and bring the group videoconference closer to face-to-face communication.
Petr Slovák, Eva Hladká, Pavel Troubil
CollaborateCom3