Resource Placement With Multiple Adjacency Constraints in K-Ary N-Cubes

IEEE Transactions on Parallel and Distributed Systems - United States
doi 10.1109/71.382319
Full Text
Abstract

Available in full text

Date
Authors
Publisher

Institute of Electrical and Electronics Engineers (IEEE)

Related search

A Simple Mathematical Model of Adaptive Routing in Wormhole K-Ary N-Cubes

2002English

Optimal VM Placement in Data Centres With Architectural and Resource Constraints

International Journal of Autonomous and Adaptive Communications Systems
Electronic EngineeringElectricalComputer Science
2015English

Alleviating Consumption Channel Bottleneck in Wormhole Routed K-Ary N-Cube Systems

IEEE Transactions on Parallel and Distributed Systems
HardwareComputational TheorySignal ProcessingArchitectureMathematics
1998English

K-Anonymization Approaches for Supporting Multiple Constraints

Ruan Jian Xue Bao/Journal of Software
Software
2006English

View Selection Under Multiple Resource Constraints in a Distributed Context

Lecture Notes in Computer Science
Computer ScienceTheoretical Computer Science
2012English

Design of a Circuit-Switched Highly Fault-Tolerant K-Ary N-Cube

English

Drawing Ordered (K − 1)–Ary Trees on K–Grids

Lecture Notes in Computer Science
Computer ScienceTheoretical Computer Science
2011English

N-Ary Decomposition for Multi-Class Classification

Machine Learning
Artificial IntelligenceSoftware
2019English

Integrated Resource Management and Scheduling With Multi-Resource Constraints

English

Amanote Research

Note-taking for researchers

Follow Amanote

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

Privacy PolicyRefund Policy