Innovative applications of information technology for the developing world : Proceedings of the 3rd Asian Applied Computing Conference, Kathmandu, Nepal, 10-12 December 2005 / editor-in-charge Lalit Mohan Patnaik.

Format:

Book

Conference/Event

Author/Creator:

Asian Applied Computing Conference, Corporate Author.

Contributor:

Patnaik, L. M.

Conference Name:

Asian Applied Computing Conference (3rd : 2005 : Kathmandu, Nepal)

Asian Applied Computing Conference

Series:

Advances in Computer Science and Engineering: Reports and Monographs

Advances in computer science and engineering reports and monographs ; v. 2

Language:

English

Subjects (All):

Information technology--Developing countries--Congresses.

Information technology.

Computers--Developing countries--Congresses.

Computers.

Physical Description:

1 online resource (484 p.)

Other Title:

Proceedings of the 3rd Asian Applied Computing Conference

Place of Publication:

London : Imperial College Press ; Singapore : World Scientific [distributor], 2007.

Language Note:

English

Summary:

Information and communication technology (ICT) has become a generic and indispensable tool for addressing and solving problems in such diverse areas as management, social and health services, transportation, security and education. As the cost of equipment drops dramatically, it also becomes widely accessible in the developing countries. However, problems of high costs for adequate training of personnel, access to state-to-the-art software and the consultancies needed to facilitate access to ICT can constitute highly dissuasive factors in the dissemination of ICT in developing countries.This v

Contents:

CONTENTS; Algorithm and Computation; Combinatorial Generation of Matroid Representations: Theory and Practice P. Hlineny; 1. Introduction; 2. Matroid Extension Generation Algorithm; 3. Practical Computations; 4. Conclusions; References; Detection of Certain False Data Races from Runtime Traces K. Sinha and R. Gupta; 1. Introduction; 2. System Model; 3. Preliminaries; 4. Elimination of Some Benign Data Races; 5. Conclusion; References; Representing Series-Parallel Graphs as Intersection Graphs of Line Segments in Three Directions M. Bodirsky, C. Dangelmqr and J. Kara; 1. Introduction

2. Series-parallel Graphs3. Intersection Graphs of Line Segments; 4. Representations of SP Graphs; Acknowledgement; References; Finding the Convex Hull of a Dense Set P. Valtr; 1 Introduction; 2 The algorithm; 3 The lower bound; 4 Output-sensitive bounds; References; Probabilistic Load Balancing with Optimal Resources Set of Nodes in Clusters N. P. Gopalan and K. Nagarajan; 1 Introduction; 2 The Proposed Model; 3 Experimental Results; 4 Conclusions; References

A New Heuristic Algorithm for Multi-Dimension Multiple-Choice Knapsack Problem in Distributed System Md. Waselul Haque Sadid, M. Nazrul Alam, Md. Al Mamun, A . H. M. Sarwar Sattar, Mir Md. Jahangir Kabir and Md. Rabiul Islam1 Introduction; 2 Background and Preliminaries; 3 Distributed Algorithm D-MHEU; 4 Performance Analysis; 5 Conclusion; References; The Complexity of the Pk Partition Problem and Related Problems in Bipartite Graphs J. Monnot and S. Toulouse; 1. Introduction; 2. Complexity results; 3. Approximation results; References

Accelerating Boolean SAT Engines Using Hyper-Threading Technology T. Schubert, M. Lewis and Bernd Becker1. Introduction; 2. Mira; 3. PaMiraHT; 3.1. Dynamic Search Space Partitioning; 3.2. Knowledge Sharing; 3.2.1. Selecting and Broadcasting Clauses; 3.2.2. Integrating Clauses; 4. Experimental Results; 5 . Conclusion; References; A New Strategy for Solving Multiple-Choice Multiple-Dimension Knapsack Problem in Pram Model Md. Waselul Haque Sadid, Md. Rabid Islam, S. M. Kamrul Hasan and Md. Mostafa Akbar; 1 Introduction; 2 Related Works; 3 Parallel Heuristic Algorithm for MMKP

3.1 Complexity Analysis3.2 Experiment Results; 4 Conclusion; References; A Constant-Time Selection Algorithm on An Larpbs M. Arock and R. Ponalagusamy; 1 Introduction; 2 The Parallel Selection on an LARPBS; 2.1 Description; 2.2 The Pseudo-code and Time Analysis; 2.2.1 The Parallel Algorithm; 2.2.2 Time Complexity Analysis; 3 Discussion and Conclusion; References; Reducing Crossing Number of Multi-Color Rectilinear Steiner Trees Using Monochromatic Partitioning S. Majumber, B. B. Bhattachatya and S. M. A. Jafri; 1. Introduction; 2. Background of the Problem; 3. Solution Methodology

3.1. Steps Followed by the Heuristic Ha

Notes:

Description based upon print version of record.

Includes bibliographical references.

ISBN:

9786611867522

9781281867520

1281867527

9781860948534

1860948537