Amanote Research

Amanote Research

    RegisterSign In

Graph-Less Dynamic Dependence-Based Dynamic Slicing Algorithms

doi 10.1109/scam.2006.17
Full Text
Open PDF
Abstract

Available in full text

Date

September 1, 2006

Authors
Arpad BeszedesTamas GergelyTibor Gyimothy
Publisher

IEEE


Related search

Average-Case Analysis of Dynamic Graph Algorithms

Algorithmica
Applied MathematicsComputer Science ApplicationsComputer Science
1998English

Applying Association Analysis to Dynamic Slicing Based Fault Localization

IEICE Transactions on Information and Systems
Electronic EngineeringPattern RecognitionHardwareComputer VisionElectricalArchitectureArtificial IntelligenceSoftware
2014English

Distributed Slicing in Dynamic Systems

2007English

Dynamic Graph Cut Based Segmentation of Mammogram

SpringerPlus
Multidisciplinary
2015English

Waypoint Graph Based Fast Pathfinding in Dynamic Environment

International Journal of Distributed Sensor Networks
Computer NetworksEngineeringCommunications
2015English

Dynamic Programming-Based Search Algorithms in NLP

2009English

Dynamic Spectrum Access Algorithms Based on Survival Analysis

IEEE Transactions on Cognitive Communications and Networking
HardwareComputer NetworksArchitectureArtificial IntelligenceCommunications
2017English

Dynamic Graph Query Primitives for SDN-based Cloudnetwork Management

2012English

A Dynamic Transmission Strategy Based on Network Slicing for Cloud Radio Access Networks

2018English

Amanote Research

Note-taking for researchers

Follow Amanote

© 2025 Amaplex Software S.P.R.L. All rights reserved.

Privacy PolicyRefund Policy