| Nome |
# |
|
Online k-server routing problems, file e397d80e-622b-b0de-e053-6605fe0a1c76
|
72
|
|
The distributed wireless gathering problem, file e397d80e-4e3b-b0de-e053-6605fe0a1c76
|
70
|
|
A constant-approximate feasibility test for multiprocessor real-time scheduling, file e397d80e-6880-b0de-e053-6605fe0a1c76
|
69
|
|
The online Prize-Collecting Traveling Salesman Problem, file e397d80e-63c0-b0de-e053-6605fe0a1c76
|
66
|
|
Algorithms and complexity for periodic real-time scheduling, file e397d80e-4dd9-b0de-e053-6605fe0a1c76
|
64
|
|
Improved multiprocessor global schedulability analysis, file e397d80e-49ab-b0de-e053-6605fe0a1c76
|
54
|
|
A Java-based system for building animated presentations over the Web, file e397d80e-42ad-b0de-e053-6605fe0a1c76
|
46
|
|
A generalized parallel task model for recurrent real-time processes, file e397d80e-6c7a-b0de-e053-6605fe0a1c76
|
46
|
|
Physarum can compute shortest paths, file e397d80e-5225-b0de-e053-6605fe0a1c76
|
45
|
|
Scheduling real-time mixed-criticality jobs, file e397d80e-6f5e-b0de-e053-6605fe0a1c76
|
44
|
|
Physarum can compute shortest paths: A short proof, file e397d80e-63c7-b0de-e053-6605fe0a1c76
|
41
|
|
Stackelberg routing in arbitrary networks, file e397d80e-4eed-b0de-e053-6605fe0a1c76
|
40
|
|
On the convergence time of a natural dynamics for linear programming, file e397d80e-5654-b0de-e053-6605fe0a1c76
|
40
|
|
Two results on slime mold computations, file e397d80e-6844-b0de-e053-6605fe0a1c76
|
38
|
|
A revised model of fluid transport optimization in Physarum polycephalum, file e397d80e-69bb-b0de-e053-6605fe0a1c76
|
38
|
|
An Entropic Gradient Structure in the Network Dynamics of a Slime Mold, file e397d80e-8fa6-b0de-e053-6605fe0a1c76
|
37
|
|
Exact Response Time Analysis for Fixed Priority Memory-Processor Co-Scheduling, file e397d80e-63fa-b0de-e053-6605fe0a1c76
|
36
|
|
An approximation algorithm for the wireless gathering problem, file e397d80e-64e7-b0de-e053-6605fe0a1c76
|
36
|
|
A Laplacian approach to L1-norm minimization, file e397d80e-8f94-b0de-e053-6605fe0a1c76
|
36
|
|
Minimizing flow time in the wireless gathering problem, file e397d80e-4892-b0de-e053-6605fe0a1c76
|
35
|
|
Preemptive uniprocessor scheduling of mixed-criticality sporadic task systems, file e397d80e-55a1-b0de-e053-6605fe0a1c76
|
34
|
|
Feasibility analysis of sporadic real-time multiprocessor task systems, file e397d80e-6b02-b0de-e053-6605fe0a1c76
|
33
|
|
Partitioned EDF scheduling on a few types of unrelated multiprocessors, file e397d80e-683f-b0de-e053-6605fe0a1c76
|
32
|
|
On the Convergence Time of a Natural Dynamics for Linear Programming, file e397d80e-6c7c-b0de-e053-6605fe0a1c76
|
28
|
|
Budgeted matching and budgeted matroid intersection via the gasoline puzzle, file e397d80e-6eab-b0de-e053-6605fe0a1c76
|
25
|
|
Schedulability Analysis of Conditional Parallel Task Graphs in Multicore Systems, file e397d80e-5434-b0de-e053-6605fe0a1c76
|
6
|
|
On the power of lookahead in on-line server routing problems, file e397d80e-483d-b0de-e053-6605fe0a1c76
|
5
|
|
Physarum can compute shortest paths, file 70d942e2-75a6-4f92-a794-54e2cbd41f0d
|
4
|
|
An adversarial queueing model for online server routing, file e397d80e-39ee-b0de-e053-6605fe0a1c76
|
4
|
|
The on-line asymmetric traveling salesman problem, file e397d80e-39f7-b0de-e053-6605fe0a1c76
|
4
|
|
The complexity of uniform Nash equilibria and related regular subgraph problems, file e397d80e-3aa7-b0de-e053-6605fe0a1c76
|
4
|
|
On a Voter Model with Context-Dependent Opinion Adoption, file fa302435-2a78-4fe2-9d75-b60da7082dbe
|
4
|
|
Game-theoretic analysis of Internet switching with selfish users, file e397d80e-3f5f-b0de-e053-6605fe0a1c76
|
3
|
|
A generalized parallel task model for recurrent real-time processes, file e397d80e-5918-b0de-e053-6605fe0a1c76
|
3
|
|
Physarum-inspired multi-commodity flow dynamics, file e397d80e-f8c7-b0de-e053-6605fe0a1c76
|
3
|
|
Physarum-inspired multi-commodity flow dynamics, file e397d80e-f8c8-b0de-e053-6605fe0a1c76
|
3
|
|
New results on the complexity of uniformly mixed Nash equilibria, file e397d80e-3794-b0de-e053-6605fe0a1c76
|
2
|
|
Budgeted matching and budgeted matroid intersection via the gasoline puzzle, file e397d80e-45c6-b0de-e053-6605fe0a1c76
|
2
|
|
Feasibility analysis of sporadic real-time multiprocessor task systems, file e397d80e-49b9-b0de-e053-6605fe0a1c76
|
2
|
|
Mixed-Criticality scheduling of sporadic task systems, file e397d80e-4fdc-b0de-e053-6605fe0a1c76
|
2
|
|
Budgeted matching and budgeted matroid intersection via the gasoline puzzle, file e397d80e-4fe0-b0de-e053-6605fe0a1c76
|
2
|
|
On the compatibility of exact schedulability tests for global fixed priority pre-emptive scheduling with Audsley’s optimal priority assignment algorithm, file e397d80e-53d3-b0de-e053-6605fe0a1c76
|
2
|
|
Partitioned EDF scheduling on a few types of unrelated multiprocessors, file e397d80e-53f5-b0de-e053-6605fe0a1c76
|
2
|
|
Complexity and approximation in reoptimization, file e397d80e-54e2-b0de-e053-6605fe0a1c76
|
2
|
|
The Global EDF Scheduling of Systems of Conditional Sporadic DAG Tasks, file e397d80e-5557-b0de-e053-6605fe0a1c76
|
2
|
|
Schedulability Analysis of Conditional Parallel Task Graphs in Multicore Systems, file e397d80e-56fa-b0de-e053-6605fe0a1c76
|
2
|
|
Algorithms for hierarchical and semi-partitioned parallel scheduling, file e397d80e-8555-b0de-e053-6605fe0a1c76
|
2
|
|
On a Voter Model with Context-Dependent Opinion Adoption, file 60e19c7c-e9ce-43d9-9789-5fb6b42ba29d
|
1
|
|
On the complexity of uniformly mixed nash equilibria and related regular subgraph problems, file e397d80e-376b-b0de-e053-6605fe0a1c76
|
1
|
|
On-line algorithms, real time, the virtue of laziness, and the power of clairvoyance, file e397d80e-3824-b0de-e053-6605fe0a1c76
|
1
|
|
Portraying algorithms with Leonardo Web, file e397d80e-38f5-b0de-e053-6605fe0a1c76
|
1
|
|
An approximation algorithm for the wireless gathering problem, file e397d80e-39e7-b0de-e053-6605fe0a1c76
|
1
|
|
Online k-server routing problems, file e397d80e-39ea-b0de-e053-6605fe0a1c76
|
1
|
|
The distributed wireless gathering problem, file e397d80e-3a55-b0de-e053-6605fe0a1c76
|
1
|
|
The online Prize-Collecting Traveling Salesman Problem, file e397d80e-3aa3-b0de-e053-6605fe0a1c76
|
1
|
|
Visual editing of animated algorithms: The Leonardo Web builder, file e397d80e-3ded-b0de-e053-6605fe0a1c76
|
1
|
|
Stackelberg routing in arbitrary networks, file e397d80e-4045-b0de-e053-6605fe0a1c76
|
1
|
|
On the Convergence Time of a Natural Dynamics for Linear Programming, file e397d80e-41c1-b0de-e053-6605fe0a1c76
|
1
|
|
An approximation algorithm for the wireless gathering problem, file e397d80e-469d-b0de-e053-6605fe0a1c76
|
1
|
|
Scheduling real-time mixed-criticality jobs, file e397d80e-49a8-b0de-e053-6605fe0a1c76
|
1
|
|
Feasibility analysis of sporadic real-time multiprocessor task systems, file e397d80e-49b8-b0de-e053-6605fe0a1c76
|
1
|
|
Minimizing flow time in the wireless gathering problem, file e397d80e-4ae4-b0de-e053-6605fe0a1c76
|
1
|
|
Online k-server routing problems, file e397d80e-4cda-b0de-e053-6605fe0a1c76
|
1
|
|
A constant-approximate feasibility test for multiprocessor real-time scheduling, file e397d80e-4d6f-b0de-e053-6605fe0a1c76
|
1
|
|
Stackelberg routing in arbitrary networks, file e397d80e-4eec-b0de-e053-6605fe0a1c76
|
1
|
|
The distributed wireless gathering problem, file e397d80e-4f66-b0de-e053-6605fe0a1c76
|
1
|
|
A constant-approximate feasibility test for multiprocessor real-time scheduling, file e397d80e-4f8e-b0de-e053-6605fe0a1c76
|
1
|
|
Feasibility analysis of sporadic real-time multiprocessor task systems, file e397d80e-4fda-b0de-e053-6605fe0a1c76
|
1
|
|
Minimizing average flow time in sensor data gathering, file e397d80e-50c2-b0de-e053-6605fe0a1c76
|
1
|
|
Budgeted matching and budgeted matroid intersection via the gasoline puzzle, file e397d80e-50ff-b0de-e053-6605fe0a1c76
|
1
|
|
Algorithms and complexity for periodic real-time scheduling, file e397d80e-51ab-b0de-e053-6605fe0a1c76
|
1
|
|
A constant-approximate feasibility test for multiprocessor real-time scheduling, file e397d80e-51e6-b0de-e053-6605fe0a1c76
|
1
|
|
The preemptive uniprocessor scheduling of mixed-criticality implicit-deadline sporadic task systems, file e397d80e-5220-b0de-e053-6605fe0a1c76
|
1
|
|
Partitioned EDF scheduling on a few types of unrelated multiprocessors, file e397d80e-53f4-b0de-e053-6605fe0a1c76
|
1
|
|
Polynomial-time exact schedulability tests for harmonic real-time tasks, file e397d80e-546a-b0de-e053-6605fe0a1c76
|
1
|
|
Response-Time Analysis of Conditional DAG Tasks in Multiprocessor Systems, file e397d80e-54af-b0de-e053-6605fe0a1c76
|
1
|
|
Algoritmi per aste e giochi, file e397d80e-54e4-b0de-e053-6605fe0a1c76
|
1
|
|
A scheduling model inspired by control theory, file e397d80e-56fe-b0de-e053-6605fe0a1c76
|
1
|
|
Algorithms for auctions and games, file e397d80e-5730-b0de-e053-6605fe0a1c76
|
1
|
|
A generalized parallel task model for recurrent real-time processes, file e397d80e-5854-b0de-e053-6605fe0a1c76
|
1
|
|
ILP models for the allocation of recurrent workloads upon heterogeneous multiprocessors, file e397d80e-5917-b0de-e053-6605fe0a1c76
|
1
|
|
Pooling or Sampling: Collective Dynamics for Electrical Flow Estimation, file e397d80e-5919-b0de-e053-6605fe0a1c76
|
1
|
|
Two results on slime mold computations, file e397d80e-5980-b0de-e053-6605fe0a1c76
|
1
|
|
A revised model of fluid transport optimization in Physarum polycephalum, file e397d80e-5c1f-b0de-e053-6605fe0a1c76
|
1
|
|
Feasibility analysis in the sporadic DAG task model, file e397d80e-5d37-b0de-e053-6605fe0a1c76
|
1
|
|
Data Gathering in Wireless Networks, file e397d80e-5e20-b0de-e053-6605fe0a1c76
|
1
|
|
Physarum can compute shortest paths: Convergence proofs and complexity bounds, file e397d80e-5e8f-b0de-e053-6605fe0a1c76
|
1
|
|
Memory-processor co-scheduling in fixed priority systems, file e397d80e-5ed1-b0de-e053-6605fe0a1c76
|
1
|
|
Multiprocessor Real-Time Scheduling with Hierarchical Processor Affinities, file e397d80e-5f10-b0de-e053-6605fe0a1c76
|
1
|
|
Prize-Collecting Traveling Salesman and Related Problems, file e397d80e-5f77-b0de-e053-6605fe0a1c76
|
1
|
|
On explorers, chasers and cameramen, file e397d80e-5fb2-b0de-e053-6605fe0a1c76
|
1
|
|
Exact Response Time Analysis for Fixed Priority Memory-Processor Co-Scheduling, file e397d80e-5fc3-b0de-e053-6605fe0a1c76
|
1
|
|
On the compatibility of exact schedulability tests for global fixed priority pre-emptive scheduling with Audsley’s optimal priority assignment algorithm, file e397d80e-60f2-b0de-e053-6605fe0a1c76
|
1
|
|
ILP-Based Approaches to Partitioning Recurrent Workloads Upon Heterogeneous Multiprocessors, file e397d80e-6195-b0de-e053-6605fe0a1c76
|
1
|
|
The on-line asymmetric traveling salesman problem, file e397d80e-7a0d-b0de-e053-6605fe0a1c76
|
1
|
|
Algorithms for hierarchical and semi-partitioned parallel scheduling, file e397d80e-8001-b0de-e053-6605fe0a1c76
|
1
|
| Totale |
1.219 |