The following pages link to Vincenzo Bonifaci (Q255295):
Displaying 50 items.
- On the compatibility of exact schedulability tests for global fixed priority pre-emptive scheduling with Audsley's optimal priority assignment algorithm (Q255296) (← links)
- A revised model of fluid transport optimization in \textit{Physarum polycephalum} (Q510507) (← links)
- Budgeted matching and budgeted matroid intersection via the gasoline puzzle (Q543415) (← links)
- The distributed wireless gathering problem (Q627160) (← links)
- Feasibility analysis of sporadic real-time multiprocessor task systems (Q692625) (← links)
- Online \(k\)-server routing problems (Q839628) (← links)
- The complexity of uniform Nash equilibria and related regular subgraph problems (Q935157) (← links)
- The on-line asymmetric traveling salesman problem (Q935844) (← links)
- An approximation algorithm for the wireless gathering problem (Q957364) (← links)
- On the power of lookahead in on-line server routing problems (Q959800) (← links)
- The online prize-collecting traveling salesman problem (Q963439) (← links)
- Improved multiprocessor global schedulability analysis (Q993508) (← links)
- An adversarial queueing model for online server routing (Q995586) (← links)
- Physarum can compute shortest paths: a short proof (Q1941685) (← links)
- On the convergence time of a natural dynamics for linear programming (Q1986962) (← links)
- Algorithms for hierarchical and semi-partitioned parallel scheduling (Q2037194) (← links)
- A Laplacian approach to \(\ell_1\)-norm minimization (Q2044482) (← links)
- Physarum-inspired multi-commodity flow dynamics (Q2139048) (← links)
- Partitioned EDF scheduling on a few types of unrelated multiprocessors (Q2251370) (← links)
- ILP models for the allocation of recurrent workloads upon heterogeneous multiprocessors (Q2281614) (← links)
- Two results on slime mold computations (Q2415321) (← links)
- A constant-approximate feasibility test for multiprocessor real-time scheduling (Q2428689) (← links)
- \textit{Physarum} can compute shortest paths (Q2632109) (← links)
- Preemptive uniprocessor scheduling of mixed-criticality sporadic task systems (Q2796402) (← links)
- Complexity and approximation in reoptimization (Q2906564) (← links)
- Algorithms and complexity for periodic real-time scheduling (Q2933634) (← links)
- Schedulability Analysis of Conditional Parallel Task Graphs in Multicore Systems (Q2989519) (← links)
- (Q3047309) (← links)
- Mixed-Criticality Scheduling of Sporadic Task Systems (Q3092260) (← links)
- Efficiency of Restricted Tolls in Non-atomic Network Routing Games (Q3095283) (← links)
- Stackelberg Routing in Arbitrary Networks (Q3169096) (← links)
- Minimizing flow time in the wireless gathering problem (Q3189016) (← links)
- Data Gathering in Wireless Networks (Q3404477) (← links)
- Budgeted Matching and Budgeted Matroid Intersection Via the Gasoline Puzzle (Q3503853) (← links)
- The Distributed Wireless Gathering Problem (Q3511417) (← links)
- A Constant-Approximate Feasibility Test for Multiprocessor Real-Time Scheduling (Q3541088) (← links)
- Scheduling Real-Time Mixed-Criticality Jobs (Q3586075) (← links)
- (Q4910712) (← links)
- On the Convergence Time of a Natural Dynamics for Linear Programming (Q5136233) (← links)
- Scheduling Real-Time Mixed-Criticality Jobs (Q5274656) (← links)
- Exact Response Time Analysis for Fixed Priority Memory-Processor Co-Scheduling (Q5280460) (← links)
- Physarum Can Compute Shortest Paths: Convergence Proofs and Complexity Bounds (Q5327457) (← links)
- Algorithms and Data Structures (Q5394259) (← links)
- (Q5417713) (← links)
- Online k-Server Routing Problems (Q5443511) (← links)
- Fundamentals of Computation Theory (Q5492928) (← links)
- (Q5743394) (← links)
- An Approximation Algorithm for the Wireless Gathering Problem (Q5757885) (← links)
- Theory and Applications of Models of Computation (Q5898857) (← links)
- Egalitarian roommate allocations: complexity and stability (Q6658303) (← links)
