14 results
Search Results
2. PREFACE.
- Author
-
MOREIRA, NELMA and REIS, ROGÉRIO
- Subjects
ALGORITHMS ,ALGEBRA ,MATHEMATICAL variables ,DIRECTED graphs ,COMPUTER systems ,COMPUTER science - Published
- 2013
- Full Text
- View/download PDF
3. SOME INITIAL THOUGHTS ON BOUNDED QUERY COMPUTATIONS OVER THE REALS.
- Author
-
MEER, KLAUS
- Subjects
RECURSION theory ,QUERY (Information retrieval system) ,MACHINE theory ,ALGORITHMS ,SET theory ,COMPUTER systems ,MATHEMATICAL bounds - Abstract
A classical theme in recursion theory is the question whether for a set A and n given elements x
1 ,...,xn , an oracle machine having access to an oracle B can determine which of the elements xi belong to A. And if yes, how many queries are necessary? Here, B = A is possible and leads to interesting special cases of the general question In the present paper we adapt classical notions in this area of bounded query computations to real number algorithms as formalized by Blum, Shub, and Smale and analyze them in the new framework. Among the results obtained we find: A real version of a non-speedup theorem based on real quantifier elimination, some basic properties about selective real sets, and a way to construct natural terse sets in ℝ by applying the implicit function theorem. The purpose of the paper is on presenting some interesting questions and basic results as an appertizer to intensify research into this direction. [ABSTRACT FROM AUTHOR]- Published
- 2012
- Full Text
- View/download PDF
4. SELF STABILIZATION IN DISTRIBUTED KNOT DETECTION.
- Author
-
SANTHOSH, PRABHU M.
- Subjects
DISTRIBUTED computing ,ALGORITHMS ,MATHEMATICAL variables ,DIRECTED graphs ,SELF-stabilization (Computer science) ,COMPUTER systems - Abstract
This paper describes a failure scenario in the known self-stabilizing algorithm for knot detection in directed graphs, occurring due to incorrect computation of certain variables. A modified algorithm is proposed, which overcomes the shortcomings of the known algorithm. [ABSTRACT FROM AUTHOR]
- Published
- 2013
- Full Text
- View/download PDF
5. DECIDABILITY AND UNIVERSALITY IN THE AXIOMATIC THEORY OF COMPUTABILITY AND ALGORITHMS.
- Author
-
BURGIN, MARK
- Subjects
DECIDABILITY (Mathematical logic) ,AXIOMATIC set theory ,ALGORITHMS ,RECURSIVE functions ,COMPUTER systems ,MATHEMATICS theorems ,MATHEMATICAL models - Abstract
In this paper, we study to what extent decidability is connected to universality. A natural context for such a study is provided by the axiomatic theory of computability, automata and algorithms. In Section 2, we introduce necessary concepts, constructions, axioms, postulates, conditions and problems. Section 3 contains the main results of the paper. In particular, it is demonstrated (Theorems 1 and 2) that undecidability of algorithmic problems does not depend on existence of universal algorithms and may be caused by weaker conditions. At the same time, results of Theorems 2 and 3 demonstrate that decidability is incompatible with universality. It is also proved (Theorem 5) that sufficiently big classes of total algorithms/automata, such as the class of all primitive recursive functions, cannot have universal algorithms/automata. [ABSTRACT FROM AUTHOR]
- Published
- 2012
- Full Text
- View/download PDF
6. THE STEVENS-STIRLING-ALGORITHM FOR SOLVING PARITY GAMES LOCALLY REQUIRES EXPONENTIAL TIME.
- Author
-
FRIEDMANN, OLIVER and Sakarovitch, Jacques
- Subjects
ALGORITHMS ,EXPONENTIAL functions ,LINEAR systems ,COMPUTER systems ,COMPUTER science - Abstract
This paper presents a new lower bound for the model-checking algorithm based on solving parity games due to Stevens and Stirling. We outline a family of games of linear size on which the algorithm requires exponential time. [ABSTRACT FROM AUTHOR]
- Published
- 2010
- Full Text
- View/download PDF
7. A MINIMUM-PROCESS COORDINATED CHECKPOINTING PROTOCOL FOR MOBILE COMPUTING SYSTEMS.
- Author
-
Gupta, Sunil Kumar, Chauhan, R. K., and Kumar, Parveen
- Subjects
MOBILE computing ,COMPUTER systems ,ALGORITHMS ,FAULT tolerance (Engineering) ,FAULT-tolerant computing ,SYSTEMS design - Abstract
Checkpoint is a designated place in a program at which normal process is interrupted specifically to preserve the status information necessary to allow resumption of processing at a later time. A checkpoint algorithm for mobile distributed systems needs to handle many new issues like: mobility, low bandwidth of wireless channels, lack of stable storage on mobile nodes, disconnections, limited battery power and high failure rate of mobile nodes. These issues make traditional checkpointing techniques unsuitable for such environments. Minimum-process coordinated checkpointing is an attractive approach to introduce fault tolerance in mobile distributed systems transparently. This approach is domino-free, requires at most two checkpoints of a process on stable storage, and forces only a minimum number of processes to checkpoint. But, it requires extra synchronization messages, blocking of the underlying computation or taking some useless checkpoints. In this paper, we design a minimum-process checkpointing algorithm for mobile distributed systems, where no useless checkpoint is taken. We reduce the blocking of processes by allowing the processes to do their normal computations, send messages and receive selective messages during their blocking period. [ABSTRACT FROM AUTHOR]
- Published
- 2008
- Full Text
- View/download PDF
8. Resource Estimation Algorithm Under Impreciseness Using Inclusion Scheduling.
- Author
-
Chantrapornchai, Chantana and Tongsima, Sissades
- Subjects
ALGORITHMS ,COMPUTER systems - Abstract
In this paper, we propose a resource estimation algorithm which considers imprecise system characteristics and multiple design attributes. The algorithm is based on a polynomial-time process called inclusion scheduling. Inclusion scheduling takes imprecise system information and generates an averagely good schedule with respect to a design goal. The schedule is associated with various properties. These information are used to determine the initial resource bounds subject to the design goal. Experimental results showing the effectiveness of the approach by comparing the design configuration generated by the traditional algorithm and the approach are presented. [ABSTRACT FROM AUTHOR]
- Published
- 2001
- Full Text
- View/download PDF
9. OPTIMAL CONSTRUCTION OF SENSE OF DIRECTION IN A TORUS BY A MOBILE AGENT.
- Author
-
BECHA, HANANE and FLOCCHINI, PAOLA
- Subjects
- *
ALGORITHMS , *MOBILE agent systems , *COMPUTER systems , *COMPUTER networks , *COMPUTER programming , *COMPUTER science - Abstract
Sense of direction is a property of the edge-labeling of a network whose availability facilitates computations and often decreases their complexity. In this paper we consider the problem of providing a sense of direction to an anonymous, unoriented torus. The edges of the torus are initially labeled arbitrarily, and they have to be relabeled with a classical compass sense of direction. We first describe an algorithm where the relabeling of the edges is performed by a mobile agent that carries a token. The algorithm is optimal both in terms of number of tokens (with no tokens the task cannot be performed), and in terms of number of moves. We then show that the same technique can be used to orient the torus in the classical message-passing environment, thus obtaining an orientation algorithm that improves all the existing ones in this setting. [ABSTRACT FROM AUTHOR]
- Published
- 2007
- Full Text
- View/download PDF
10. VERIFYING VERY LARGE INDUSTRIAL CIRCUITS USING 100 PROCESSES AND BEYOND.
- Author
-
FIX, LIMOR, GRUMBERG, ORNA, HEYMAN, AMNON, HEYMAN, TAMIR, and SCHUSTER, ASSAF
- Subjects
- *
DISTRIBUTED computing , *ALGORITHMS , *PRODUCTION scheduling , *COMPUTER systems , *GRID computing , *SYSTEMS design , *ARRAY processors - Abstract
Recent advances in scheduling and networking have paved the way for efficient exploitation of large-scale distributed computing platforms such as computational grids and huge clusters. Such infrastructures hold great promise for the highly resource-demanding task of verifying and checking large models, given that model checkers would be designed with a high degree of scalability and flexibility in mind. In this paper we focus on the mechanisms required to execute a high-performance, distributed, symbolic model checker on top of a large-scale distributed environment. We develop a hybrid algorithm for slicing the state space and dynamically distribute the work among the worker processes. We show that the new approach is faster, more effective, and thus much more scalable than previous slicing algorithms. We then present a checkpoint-restart module that has very low overhead. This module can be used to combat failures, the likelihood of which increases with the size of the computing plat-form. However, checkpoint-restart is even more handy for the scheduling system: it can be used to avoid reserving large numbers of workers, thus making the distributed computation work-efficient. Finally, we discuss for the first time the effect of reorder on the distributed model checker and show how the distributed system performs more efficient reordering than the sequential one. We implemented our contributions on a network of 200 processors, using a distributed scalable scheme that employs a high-performance industrial model checker from Intel. Our results show that the system was able to verify real-life models much larger than was previously possible. [ABSTRACT FROM AUTHOR]
- Published
- 2007
- Full Text
- View/download PDF
11. Exploration of Faulty Hamiltonian Graphs.
- Author
-
Caissy, David and Pelc, Andrzej
- Subjects
HAMILTONIAN graph theory ,GRAPH theory ,GRAPHIC methods ,ALGORITHMS ,MOBILE agent systems ,COMPUTER systems ,DISTRIBUTED computing - Abstract
We consider the problem of exploration of networks, some of whose edges are faulty. A mobile agent, situated at a starting node and unaware of which edges are faulty, has to explore the connected fault-free component of this node by visiting all of its nodes. The cost of the exploration is the number of edge traversals. For a given network and given starting node, the overhead of an exploration algorithm is the worst-case ratio (taken over all fault configurations) of its cost to the cost of an optimal algorithm which knows where faults are situated. An exploration algorithm, for a given network and given starting node, is called perfectly competitive if its overhead is the smallest among all exploration algorithms not knowing the location of faults. We design a perfectly competitive exploration algorithm for any ring, and show that, for networks modeled by hamiltonian graphs, the overhead of any DFS exploration is at most 10/9 times larger than that of a perfectly competitive algorithm. Moreover, for hamiltonian graphs of size at least 24, this overhead is less than 6% larger than that of a perfectly competitive algorithm. [ABSTRACT FROM AUTHOR]
- Published
- 2016
- Full Text
- View/download PDF
12. EFFICIENT GRID EXPLORATION WITH A STATIONARY TOKEN.
- Author
-
PELC, ANDRZEJ and TIANE, ANAS
- Subjects
GRID computing ,MOBILE agent systems ,ALGORITHMS ,COMPUTER systems ,DISTRIBUTED computing ,NUMBER theory - Abstract
A mobile agent starting at an arbitrary node of an m × k grid, for 1 < m ≤ k, has to explore the grid by visiting all its nodes and traversing all edges. The cost of an exploration algorithm is the number of edge traversals by the agent. Nodes of the grid are unlabeled and ports at each node v have distinct numbers in {0,..., d − 1}, where d = 2, 3, 4 is the degree of v. Port numbering is local, i.e., there is no relation between port numbers at different nodes. When visiting a node the agent sees its degree. It also sees the port number by which it enters a node and can choose the port number by which it leaves a visited node. We are interested in deterministic exploration algorithms working at low cost. We consider the scenario in which the agent is equipped with a stationary token situated at its starting node. The agent sees the token whenever it visits this node. We give an exploration algorithm working at cost O(k
2 ) for 2 × k grids, and at cost O(m2 k), for m × k grids, when 2 < m ≤ k. [ABSTRACT FROM AUTHOR]- Published
- 2014
- Full Text
- View/download PDF
13. AN IMPROVED PREFIX-FREE REGULAR-EXPRESSION MATCHING.
- Author
-
YO-SUB HAN
- Subjects
MACHINE learning ,ALGORITHMS ,MATHEMATICAL models ,COMPUTER systems ,MACHINE theory ,INFORMATION theory - Abstract
We revisit the regular-expression matching problem with respect to prefix-freeness of the pattern. It is known that a prefix-free pattern gives only a linear number of matching substrings in the size of an input text. We improve the previous algorithm and suggest an efficient algorithm that finds all pairs (start, end) of start and end positions of all matching substrings with a single scan of the input when the pattern is a prefix-free regular expression. [ABSTRACT FROM AUTHOR]
- Published
- 2013
- Full Text
- View/download PDF
14. THE DESIGN PRINCIPLES AND ALGORITHMS OF A WEIGHTED GRAMMAR LIBRARY.
- Author
-
Cyril Allaijzen, Mehryar Morri, and Brian Roark
- Subjects
COMPUTER software ,ALGORITHMS ,GRAMMAR ,PSEUDOCODE (Computer program language) ,PROGRAMMING languages ,COMPUTER systems - Abstract
We present the software design principles, algorithms, and utilities of a general weighted grammar library, the GRM Library, that can be used in a variety of applications in text, speech, and biosequence processing. Several of the algorithms and utilities of this library are described, including in some cases their pseudocodes and pointers to their use in applications. The algorithms and the utilities were designed to support a wide variety of semirings and the representation and use of large grammars and automata of several hundred million rules or transitions. [ABSTRACT FROM AUTHOR]
- Published
- 2005
- Full Text
- View/download PDF
Discovery Service for Jio Institute Digital Library
For full access to our library's resources, please sign in.