UB Paderborn / Katalog / Suche / in CDI

Sortiert nach

Einfacher Volltextzugriff von (fast) überall

Installieren Sie die LibKey Nomad-Browsererweiterung und erhalten Sie von vielen Webseiten einfachen Zugriff auf lizenzierte Volltexte oder Open Access Publikationen. Mehr erfahren...

Local Search Based Approximation Algorithms for Two-Stage Stochastic Location Problems

Approximation and Online Algorithms, 2017, Vol.10138, p.197-209

2017

Volltextzugriff (PDF)

Turing Kernelization for Finding Long Paths and Cycles in Restricted Graph Classes

Algorithms - ESA 2014, p.579-591

Volltextzugriff (PDF)

Robust Online Algorithms for Dynamic Choosing Problems

Connecting with Computability, 2021, Vol.12813, p.38-49

2021

Volltextzugriff (PDF)

Hand Gesture Recognition Based on EMG Data: A Convolutional Neural Network Approach

Physiological Computing Systems, 2019, Vol.10057, p.180-197

2019

Volltextzugriff (PDF)

On the Parameterized Complexity of Computing Graph Bisections

Graph-Theoretic Concepts in Computer Science, p.76-87

Volltextzugriff (PDF)

Packet Routing: Complexity and Algorithms

Approximation and Online Algorithms, p.217-228

Volltextzugriff (PDF)

The θ5-Graph is a Spanner

Graph-Theoretic Concepts in Computer Science, p.100-114

Volltextzugriff (PDF)

Sparse Square Roots

Graph-Theoretic Concepts in Computer Science, p.177-188

Volltextzugriff (PDF)

High-Level Counterexamples for Probabilistic Automata

Quantitative Evaluation of Systems, p.39-54

Volltextzugriff (PDF)

A 3/2-Approximation Algorithm for Rate-Monotonic Multiprocessor Scheduling of Implicit-Deadline Tasks

Approximation and Online Algorithms, p.166-177

Volltextzugriff (PDF)

Threshold-Coloring and Unit-Cube Contact Representation of Graphs

Graph-Theoretic Concepts in Computer Science, p.26-37

Volltextzugriff (PDF)

Thickness and Colorability of Geometric Graphs

Graph-Theoretic Concepts in Computer Science, p.237-248

Volltextzugriff (PDF)

On Retracts, Absolute Retracts, and Folds in Cographs

Graph-Theoretic Concepts in Computer Science, p.321-332

Volltextzugriff (PDF)

Colouring of Graphs with Ramsey-Type Forbidden Subgraphs

Graph-Theoretic Concepts in Computer Science, p.201-212

Volltextzugriff (PDF)

Linear-Time Algorithms for Scattering Number and Hamilton-Connectivity of Interval Graphs

Graph-Theoretic Concepts in Computer Science, p.127-138

Volltextzugriff (PDF)

Scheduling to Minimize Average Completion Time Revisited: Deterministic On-Line Algorithms

Approximation and Online Algorithms, 2004, p.227-234

2004

Volltextzugriff (PDF)

Improved Inapproximability Results for Counting Independent Sets in the Hard-Core Model

Approximation, Randomization, and Combinatorial Optimization. Algorithms and Techniques, p.567-578

Volltextzugriff (PDF)

Tangible and Wearable User Interfaces for Supporting Collaboration among Emergency Workers

Collaboration and Technology, p.192-199

Volltextzugriff (PDF)

SoCCR – Optimistic Concurrency Control for the Web-Based Collaborative Framework Metafora

Collaboration and Technology, p.153-160

Volltextzugriff (PDF)

A General Framework for Designing Approximation Schemes for Combinatorial Optimization Problems with Many Objectives Combined into One

Approximation, Randomization and Combinatorial Optimization. Algorithms and Techniques, p.179-192

Volltextzugriff (PDF)

On Preemptive Resource Constrained Scheduling: Polynomial-Time Approximation Schemes

Integer Programming and Combinatorial Optimization, 2002, Vol.2337, p.329-349

2002

Volltextzugriff (PDF)

Graphs of Edge-Intersecting Non-splitting Paths in a Tree: Towards Hole Representations: Extended Abstract

Graph-Theoretic Concepts in Computer Science, p.115-126

Volltextzugriff (PDF)

A Numerical Treatment of Neuberger’s Lattice Dirac Operator

Numerical Challenges in Lattice Quantum Chromodynamics, p.29-39

Volltextzugriff (PDF)

Encouraging Cooperation in Sharing Supermodular Costs: Extended Abstract

Approximation, Randomization, and Combinatorial Optimization. Algorithms and Techniques, p.271-285

Volltextzugriff (PDF)

On the b-Partite Random Asymmetric Traveling Salesman Problem and Its Assignment Relaxation

Approximation, Randomization, and Combinatorial Optimization: Algorithms and Techniques, p.192-201

Volltextzugriff (PDF)

1 – 25 von 27

Suche als RSS-Feed

Aktive Filter

KollektionIngenta

PublikationsformBuchkapitel

Suchergebnisse filtern

Filter anzeigen

Nur zeigen

Geprüft (Peer-Review)
(21)
Mit Volltextzugriff
(27)

Sprache

Englisch
(27)

Erscheinungsjahr

n.n

Thema

Computer Science
(13)
Computer Science, Theory & Methods
(12)
Science & Technology
(12)
Technology
(12)
Mathematics
(3)
Mathematics, Applied
(3)
Physical Sciences
(3)
Planar Graph
(3)
Applied Sciences
(2)
Competitive Ratio
(2)
Exact Sciences And Technology
(2)
Model Check
(2)
Polynomial Time Approximation Scheme
(2)
Preemptive Schedule
(2)
Short Path
(2)
Tree Decomposition
(2)
Vertex Cover
(2)
Ablation Study
(1)
Absolute Retract
(1)
Agent Node
(1)

15 weitere anzeigen...

Weniger anzeigen...

Kollektion

IngentaConnect
(27)
Springer Book Series (Lecture Notes)
(27)
Ebook Central Perpetual and DDA
(6)
eBooks on EBSCOhost
(6)

Menü

Weitere Dienste

Einstellungen

Local Search Based Approximation Algorithms for Two-Stage Stochastic Location Problems

Turing Kernelization for Finding Long Paths and Cycles in Restricted Graph Classes

Robust Online Algorithms for Dynamic Choosing Problems

Hand Gesture Recognition Based on EMG Data: A Convolutional Neural Network Approach

On the Parameterized Complexity of Computing Graph Bisections

Packet Routing: Complexity and Algorithms

The θ5-Graph is a Spanner

Sparse Square Roots

High-Level Counterexamples for Probabilistic Automata

A 3/2-Approximation Algorithm for Rate-Monotonic Multiprocessor Scheduling of Implicit-Deadline Tasks

Threshold-Coloring and Unit-Cube Contact Representation of Graphs

Thickness and Colorability of Geometric Graphs

On Retracts, Absolute Retracts, and Folds in Cographs

Colouring of Graphs with Ramsey-Type Forbidden Subgraphs

Linear-Time Algorithms for Scattering Number and Hamilton-Connectivity of Interval Graphs

Scheduling to Minimize Average Completion Time Revisited: Deterministic On-Line Algorithms

Improved Inapproximability Results for Counting Independent Sets in the Hard-Core Model

Tangible and Wearable User Interfaces for Supporting Collaboration among Emergency Workers

SoCCR – Optimistic Concurrency Control for the Web-Based Collaborative Framework Metafora

A General Framework for Designing Approximation Schemes for Combinatorial Optimization Problems with Many Objectives Combined into One

On Preemptive Resource Constrained Scheduling: Polynomial-Time Approximation Schemes

Graphs of Edge-Intersecting Non-splitting Paths in a Tree: Towards Hole Representations: Extended Abstract

A Numerical Treatment of Neuberger’s Lattice Dirac Operator

Encouraging Cooperation in Sharing Supermodular Costs: Extended Abstract

On the b-Partite Random Asymmetric Traveling Salesman Problem and Its Assignment Relaxation

Aktive Filter

Suchergebnisse filtern