Results 1  10
of
253
Unbounded speed variability in distributed communication systems
 In Conference Record of 9th ACM Symposium on Principles of Programming Languages
"... allocation algorithms and real time implementation of message passing in CSP. This paper concerns the fundamental problem of synchronizing communication between distributed processes whose speeds (steps per real time unit) vary dynamically. Communication must be established in matching pairs, which ..."
Abstract

Cited by 3 (2 self)
 Add to MetaCart
allocation algorithms and real time implementation of message passing in CSP. This paper concerns the fundamental problem of synchronizing communication between distributed processes whose speeds (steps per real time unit) vary dynamically. Communication must be established in matching pairs, which
Two Decentralized Algorithms for Strong Interaction Fairness for Systems with Unbounded Speed Variability
 Theretical Computer Science
, 2000
"... We present two randomized algorithms, one for message passing and the other for shared memory, that, with probability 1, schedule multiparty interactions in a strongly fair manner. Both algorithms improve upon a previous result by Joung and Smolka (proposed in a sharedmemory model, along with a str ..."
Abstract

Cited by 2 (0 self)
 Add to MetaCart
straightforward conversion to the messagepassing paradigm) in the following aspects: First, processes' speeds as well as communication delays need not be bounded by any predetermined constant. Secondly, our algorithms are completely decentralized, and the sharedmemory solution makes use of only single
Unbounded prooflength speedup in deduction modulo
 CSL 2007, VOLUME 4646 OF LNCS
, 2007
"... In 1973, Parikh proved a speedup theorem conjectured by Gödel 37 years before: there exist arithmetical formulæ that are provable in first order arithmetic, but whose shorter proof in second order arithmetic is arbitrarily smaller than any proof in first order. On the other hand, resolution for h ..."
Abstract

Cited by 7 (3 self)
 Add to MetaCart
In 1973, Parikh proved a speedup theorem conjectured by Gödel 37 years before: there exist arithmetical formulæ that are provable in first order arithmetic, but whose shorter proof in second order arithmetic is arbitrarily smaller than any proof in first order. On the other hand, resolution
VisibilityBased PursuitEvasion with Bounded Speed
"... This paper presents an algorithm for a visibilitybased pursuitevasion problem in which bounds on the speeds of the pursuer and evader are given. The pursuer tries to find the evader inside of a simplyconnected polygonal environment, and the evader in turn tries actively to avoid detection. The ..."
Abstract

Cited by 23 (1 self)
 Add to MetaCart
. The algorithm is at least as powerful as the complete algorithm for the unbounded speed case, and with the knowledge of speed bounds, generates solutions for environments that were previously unsolvable. Furthermore, the paper develops a characterization of the set of possible evader positions as a function
Searching for Mobile Intruders in a Polygonal Region by a Group of Mobile Searchers
 SIAM JOURNAL ON COMPUTING
"... The problem of searching for mobile intruders in a polygonal region by mobile searchers is considered. A searcher can move continuously inside a polygon holding a flashlight that emits a single ray of light whose direction can be changed continuously. The visibility of a searcher at any time instant ..."
Abstract

Cited by 156 (3 self)
 Add to MetaCart
instant is limited to the points on the ray. The intruders can move continuously with unbounded speed. We denote by ps(P ) the polygon search number of a simple polygon P , which is the number of searchers necessary and sufficient to search P . Let n, r, b and g be the number of edges, the number
CAPTURE PURSUIT GAMES ON UNBOUNDED DOMAINS
"... ABSTRACT. We introduce simple tools from geometric convexity to analyze capturetype (or “Lion and Man”) pursuit problems in unbounded domains. The main result is a necessary and sufficient condition for eventual capture in equalspeed discretetime multipursuer capture games on convex Euclidean dom ..."
Abstract

Cited by 10 (2 self)
 Add to MetaCart
ABSTRACT. We introduce simple tools from geometric convexity to analyze capturetype (or “Lion and Man”) pursuit problems in unbounded domains. The main result is a necessary and sufficient condition for eventual capture in equalspeed discretetime multipursuer capture games on convex Euclidean
On the role of entanglement in quantum computational speedup
"... For any quantum algorithm operating on pure states we prove that the presence of multipartite entanglement, with a number of parties that increases unboundedly with input size, is necessary if the quantum algorithm is to offer an exponential speedup over classical computation. Furthermore we prove ..."
Abstract

Cited by 79 (0 self)
 Add to MetaCart
For any quantum algorithm operating on pure states we prove that the presence of multipartite entanglement, with a number of parties that increases unboundedly with input size, is necessary if the quantum algorithm is to offer an exponential speedup over classical computation. Furthermore we
ON THE SPEED OF SPREAD FOR FRACTIONAL REACTIONDIFFUSION EQUATIONS
, 908
"... Abstract. The fractional reaction diffusion equation ∂tu + Au = g(u) is discussed, where A is a fractional differential operator on R of order α ∈ (0,2), the C 1 function g vanishes at ζ = 0 and ζ = 1 and either g ≥ 0 on (0,1) or g < 0 near ζ = 0. In the case of nonnegative g, it is shown that s ..."
Abstract

Cited by 10 (0 self)
 Add to MetaCart
that solutions with initial support on the positive half axis spread into the left half axis with unbounded speed if g(ζ) satisfies some weak growth condition near ζ = 0 in the case α> 1, or if g is merely positive on a sufficiently large interval near ζ = 1 in the case α < 1. On the other hand, it shown
Fractional semilinear parabolic equations with unbounded data
 Trans. of the AMS
"... Abstract. This paper is devoted to the study of semilinear parabolic equations whose principal term is fractional, i.e. is integral and eventually singular. A typical example is the fractional Laplace operator. This work sheds light on the fact that, if the initial datum is not bounded, assumptions ..."
Abstract

Cited by 8 (2 self)
 Add to MetaCart
, assumptions on the nonlinearity are closely related to its behaviour at infinity. The sublinear and superlinear cases are first treated by classical techniques. We next present a third original case: if the associated first order HamiltonJacobi equation is such that perturbations propagate at finite speed
Scheduling for speed bounded processors
 In Proc. ICALP
, 2008
"... Abstract. We consider online scheduling algorithms in the dynamic speed scaling model, where a processor can scale its speed between 0 and some maximum speed T. The processor uses energy at rate s α when run at speed s, where α> 1 is a constant. Most modern processors use dynamic speed scaling to ..."
Abstract

Cited by 39 (12 self)
 Add to MetaCart
total flow time plus energy for unweighted unit size jobs, and a (2 + o(1))α / ln αcompetitive algorithm to minimize fractional weighted flow time plus energy. Prior to our work, these guarantees were known only when the processor speed was unbounded (T = ∞) [4]. 1
Results 1  10
of
253