检索结果-内蒙古大学图书馆

17th Canadian Conference on Computational Geometry, CCCG 2005

作者： Roy, Sasanka Bhattacharjee, Subhasis Das, Sandip Nandy, Subhas C. Advanced Computing and Microelectronics Unit Indian Sta-tistical Institute Kolkata700 108 India

In the map labeling problem, we are given a set P = fp1;p2;: : :;png of point sites distributed on a 2D map. The label of a point pi is an axis-parallel rectangle of specified size. The objective is to label maximum number of points on the map so that the placed labels are mutually non-overlapping. Here, we investigate a special class of map labeling problem where (i) the height of the label of each point is the same but its length may be diffierent from the others, (ii) the label of a point pi touches the point at one of its four corners and (iii) it does not obscure any other point in P. We describe an efficient heuristic algorithm for this problem which runs in O(npn) time in the worst case. We run our algorithm as well as the algorithm proposed in [14] on the available benchmarks [13]. The results produced by our algorithm is same as that of [14] in most of the cases, and is one less in few cases. But the time taken by our algorithm is much less than [14]. © 2005 Canadian Conference on Computational Geometry. All rights reserved.

关键词： Heuristic algorithms

来源：评论

学校读者我要写书评

暂无评论

A Study on the Problems of Dispersion and Exploration on Graph Topology 22

A Study on the Problems of Dispersion and Exploration on Gra...

引用

23rd International Conference on Distributed computing and Networking, ICDCN 2022

作者： Das, Archak Bose, Kaustav Sau, Buddhadeb Mathematics Jadavpur University India Advanced Computing and Microelectronics Unit Indian Statistical Institute Kolkata India

ISBN: (纸本)9781450395601

In this paper we discuss two important problems: Dispersion and Exploration. We have provided two optimal algorithms for each of them. For Dispersion we have provided an algorithm which is optimal in terms of memory complexity and for Exploration we have given an algorithm which is optimal in terms of number of robots in a dynamic ring. We give a brief idea about our algorithms and novelty of our techniques. © 2022 ACM.

关键词： Topology

来源：评论

学校读者我要写书评

暂无评论

Self-stabilizing checkpointing algorithm in ring topology 1

引用

7th International Workshop on Distributed computing, IWDC 2005

作者： Mandal, Partha Sarathi Mukhopadhyaya, Krishnendu Advanced Computing and Microelectronics Unit Indian Statistical Institute 203 B T Road Kolkata 700108 India

ISBN: (数字)9783540324287

ISBN: (纸本)3540309594

If the variables used for a checkpointing algorithm have data faults, the algorithm may fail. In this paper, a self-stabilizing checkpointing algorithm is proposed for handling data faults in a ring network. The proposed algorithm can deal with concurrent initiations of checkpointing and at most one data fault per process. However, several processes may be faulty. © Springer-Verlag Berlin Heidelberg 2005.

关键词： Algorithms

来源：评论

学校读者我要写书评

暂无评论

Approximate Shortest Paths in Polygons with Violations

引用

International Journal of Computational Geometry and Applications 2020年第1期30卷 79-95页

作者： Dutta, Binayak Roy, Sasanka Department of Computer Science and Engineering Tezpur University Tezpur India Advanced Computing and Microelectronics Unit Indian Statistical Institute Kolkata India

We study the shortest k-violation path problem in a simple polygon. Let P be a simple polygon in 2 with n vertices and let s,t be a pair of points in P. Let int(P) represent the interior of P. Let P = 2(P) represent the exterior of P. For an integer k ≥ 0, the shortest k-violation path problem in P is the problem of computing the shortest path from s to t in P, such that at most k path segments are allowed to be in P. The subpaths of a k-violation path are not allowed to bend in P. For any k, we present a (1 + 2) factor approximation algorithm for the problem that runs in O(n2σ2klog n2σ2 + n2σ2k) time. Here σ = O(log(L r)) and, L, r are geometric parameters. © 2020 World Scientific Publishing Company.

关键词： approximation polygons shortest paths Steiner points triangulation violations

来源：评论

学校读者我要写书评

暂无评论

Pack your sack for the cloud 12

Pack your sack for the cloud

引用

5th India Software Engineering Conference, ISEC 2012

作者： Banerjee, Ansuman Ghosh, Sasthi C. Banerjee, Nilanjan Advanced Computing and Microelectronics Unit Indian Statistical Institute Kolkata India IBM Research - India New Delhi India

ISBN: (纸本)9781450311427

With the emergence of cloud computing, driven by significant advances in virtualization and network technologies, enterprise computing is witnessing a major paradigm shift in terms of resource consolidation. This paper introduces the concept of a comprehensive management framework for resource consolidation in cloud based systems. As it turns out, there are several interesting optimization problems with respect to resource and service utilization. This paper is a modest attempt to identify a generic pattern in the family of optimization problems and propose a unified formalism to address the associated issues. In this work we demystify a number of optimization problems in the cloud management framework and map them to the Knapsack Problem, a well-researched problem in the academic community. We believe that this classification will have significant value proposition to the cloud designer community. The repertoire of methodologies available in Knapsack research can easily provide a ready toolset to the cloud community for solving a number of key design issues. © 2012 ACM.

关键词： Cloud computing

来源：评论

学校读者我要写书评

暂无评论

Exploring a Dynamic Ring Without Landmark 23rd

Exploring a Dynamic Ring Without Landmark

引用

23rd International Symposium on Stabilization, Safety, and Security of Distributed Systems, SSS 2021

作者： Das, Archak Bose, Kaustav Sau, Buddhadeb Department of Mathematics Jadavpur University Kolkata India Advanced Computing and Microelectronics Unit Indian Statistical Institute Kolkata India

ISBN: (纸本)9783030910808

Consider a group of autonomous mobile computational entities, called agents, arbitrarily placed at some nodes of a dynamic but always connected ring. The agents neither have any knowledge about the size of the ring nor have a common notion of orientation. We consider the Exploration problem where the agents have to collaboratively explore the graph and terminate, with the requirement that each node has to be visited by at least one agent. It has been shown by Di Luna et al. [Distrib. Comput. 2020] that the problem is solvable by two anonymous agents if there is a single observably different node in the ring called landmark node. The problem is unsolvable by any number of anonymous agents in absence of a landmark node. We consider the problem with non-anonymous agents (agents with distinct identifiers) in a ring with no landmark node. The assumption of agents with distinct identifiers is strictly weaker than having a landmark node as the problem is unsolvable by two agents with distinct identifiers in absence of a landmark node. This setting has been recently studied by Mandal et al. [ALGOSENSORS 2020]. There it is shown that the problem is solvable in this setting by three agents assuming that they have edge crossing detection capability. Edge crossing detection capability is a strong assumption which enables two agents moving in opposite directions through an edge in the same round to detect each other and also exchange information. In this paper we give an algorithm that solves the problem with three agents without the edge crossing detection capability. © 2021, Springer Nature Switzerland AG.

关键词： Mobile agents

来源：评论

学校读者我要写书评

暂无评论

Distributed Pattern Formation by Autonomous Robot Swarm 22

Distributed Pattern Formation by Autonomous Robot Swarm

引用

23rd International Conference on Distributed computing and Networking, ICDCN 2022

作者： Bose, Kaustav Adhikary, Ranendu Kundu, Manash Kumar Das, Archak Sau, Buddhadeb Advanced Computing and Microelectronics Unit Indian Statistical Institute India Jadavpur University India Gayeshpur Government Polytechnic India

ISBN: (纸本)9781450395601

Arbitrary Pattern Formation is a fundamental robot coordination problem. The problem asks for a distributed algorithm that allows a swarm of autonomous mobile robots to form any pattern given as input. The majority of the works in the literature investigate the problem under models with very idealistic assumptions regarding motion and sensing capabilities of the robots. We investigate the problem, aiming towards removing these assumptions and understanding their effect on the solvability of the problem. © 2022 ACM.

关键词： Robots

来源：评论

学校读者我要写书评

暂无评论

Fast FPGA placement using space-filling curve

Fast FPGA placement using space-filling curve

引用

2005 International Conference on Field Programmable Logic and Applications, FPL

作者： Banerjee, Pritha Bhattacharjee, Subhasis Sur-Kolay, Susmita Das, Sandip Nandy, Subhas C. Advanced Computing and Microelectronics Unit Indian Statistical Institute 203 B. T. Road Kolkata India

ISBN: (纸本)0780393627

In this paper, we propose a placement method for island-style FPGAs, based on recursive bi-partitioning followed by application of space-filling curves. Experimental results of our method show 55% improvement in cost, when compared to random initial placement of the popular tool VPR. The solutions thus obtained require 44.5% fewer moves during final iterative refinement by ultra-low temperature simulated annealing, whereas the quality of solution is on the average 0.1% better. This establishes the utility of the method for fast reconfiguration of FPGA based co-processors. © 2005 IEEE.

关键词： Field programmable gate arrays

来源：评论

学校读者我要写书评

暂无评论

Efficient algorithms for channel assignment in a cellular network 4th

Efficient algorithms for channel assignment in a cellular ne...

引用

4th International Workshop on Distributed computing, IWDC 2002

作者： Sinha, Bhabani P. Advanced Computing and Microelectronics Unit Indian Statistical Institute 203 B. T. Road Kolkata India

ISBN: (纸本)354000355X

During recent years, the world is experiencing almost an exponential growth in the demand for various mobile communication services. On the other hand, the available bandwidth for such communication is very much limited. As a result, efficient utilization of bandwidth for mobile communication has become more and more critical. When a mobile cellular network is designed, each cell of the network is assigned a set of channels to provide services to the individual calls of the cell. The task of assigning frequency channels to the cells satisfying some frequency separation constraints with a view to avoiding channel interference and using as small bandwidth as possible is known as the channel assignment problem. Three types of interference are generally taken into consideration in the form of constraints: i) co-channel constraint, due to which the same channel is not allowed to be assigned to certain pairs of cells simultaneously, ii) adjacent channel constraint, for which adjacent channels are not allowed to be assigned to certain pairs of cells simultaneously, and iii) co-site constraint, which implies that any pair of channels assigned to the same cell must be separated by a certain number. In its most general form, the channel assignment problem (CAP) is equivalent to the generalized graph-coloring problem which is a well-known NPcomplete problem.

关键词：

来源：评论

学校读者我要写书评

暂无评论

Pattern Formation by Robots with Inaccurate Movements 25

Pattern Formation by Robots with Inaccurate Movements

引用

25th International Conference on Principles of Distributed Systems, OPODIS 2021

作者： Bose, Kaustav Das, Archak Sau, Buddhadeb Advanced Computing and Microelectronics Unit Indian Statistical Institute Kolkata India Department of Mathematics Jadavpur University Kolkata India

ISBN: (纸本)9783959772198

Arbitrary Pattern Formation is a fundamental problem in autonomous mobile robot systems. The problem asks to design a distributed algorithm that moves a team of autonomous, anonymous and identical mobile robots to form any arbitrary pattern F given as input. In this paper, we study the problem for robots whose movements can be inaccurate. Our movement model assumes errors in both direction and extent of the intended movement. Forming the given pattern exactly is not possible in this setting. So we require that the robots must form a configuration which is close to the given pattern F. We call this the Approximate Arbitrary Pattern Formation problem. With no agreement in coordinate system, the problem is unsolvable, even by fully synchronous robots, if the initial configuration 1) has rotational symmetry and there is no robot at the center of rotation or 2) has reflectional symmetry and there is no robot on the reflection axis. From all other initial configurations, we solve the problem by 1) oblivious, silent and semi-synchronous robots and 2) oblivious, asynchronous robots that can communicate using externally visible lights. © Kaustav Bose, Archak Das, and Buddhadeb Sau.

关键词： Mobile robots

来源：评论

学校读者我要写书评

暂无评论

建议与咨询留下您的常用邮箱和电话号码，以便我们向您反馈解决方案和替代方法

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

请选择保存的检索档案：

请选择收藏分类：

通借通还

建议与咨询 留下您的常用邮箱和电话号码，以便我们向您反馈解决方案和替代方法

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

请选择保存的检索档案： 新增检索档案 确定 取消

请选择收藏分类： 新增自定义分类 确定 取消

通借通还

建议与咨询留下您的常用邮箱和电话号码，以便我们向您反馈解决方案和替代方法

请选择保存的检索档案：

请选择收藏分类：