Results 11  20
of
25
Distributed Algorithmic Mechanism Design
, 2003
"... Distributed algorithmic mechanism design (DAMD) is an approach to designing distributed systems that takes into account both the distributedcomputational environment and the incentives of autonomous agents. In this dissertation, we study two problems, multicast cost sharing and interdomain routing. ..."
Abstract

Cited by 12 (2 self)
 Add to MetaCart
Distributed algorithmic mechanism design (DAMD) is an approach to designing distributed systems that takes into account both the distributedcomputational environment and the incentives of autonomous agents. In this dissertation, we study two problems, multicast cost sharing and interdomain routing. We also touch upon several issues important to DAMD in general, including approximation, compatibility with existing protocols, and hardness that results from the interplay of incentives and distributed computation.
Securing Digital Signatures for NonRepudiation
, 1999
"... Dispute of transactions is a common problem that could jeopardise business. Hence nonrepudiation services are essential in business transactions which provide evidence to enable dispute resolution. To be eligible as nonrepudiation evidence, the digital signature on an electronic document should re ..."
Abstract

Cited by 8 (6 self)
 Add to MetaCart
Dispute of transactions is a common problem that could jeopardise business. Hence nonrepudiation services are essential in business transactions which provide evidence to enable dispute resolution. To be eligible as nonrepudiation evidence, the digital signature on an electronic document should remain valid until its expiry date which is specified by some nonrepudiation policy. The conventional approaches are either inefficient or insecure to achieve nonrepudiation in electronic commerce. This article presents a practical scheme to secure digital signatures as nonrepudiation evidence with an adjustable degree of risk. # 1999 Elsevier Science B.V. All rights reserved. Keywords: Digital signature; Nonrepudiation; Secure electronic commerce 1.
Finding an Approximate MinimumLink Visibility Path Inside a Simple Polygon
 Inform. Process. Lett
, 1995
"... Introduction In [1] Alsuwaiyel and Lee showed that computing a minimum link path ß inside a simple polygon with n vertices such that the interior of the polygon is weakly visible from ß is NPhard. The authors also presented an O(n 3 log n) time algorithm for producing an approximate solution tha ..."
Abstract

Cited by 8 (0 self)
 Add to MetaCart
Introduction In [1] Alsuwaiyel and Lee showed that computing a minimum link path ß inside a simple polygon with n vertices such that the interior of the polygon is weakly visible from ß is NPhard. The authors also presented an O(n 3 log n) time algorithm for producing an approximate solution that was claimed to have no more than 3 times the number of links of an optimal solution. In [2] Arkin et al. show that the problem of finding a minimumlink watchman route in polygonal domains (with holes) 2 is NPcomplete and give a polynomialtime approximation algorithm with performance ratio of log n. In fact the algorithm in [1] gives a feasible solution with no bound guarantee. Here we describe in a more precise way the approximation algorithm that constructs a watchman path as well as a tour in time maxfm 2 ; mng =<F
Hardness Results for Multicast Cost Sharing (Extended Abstract)
 in Proceedings of the 22nd Conference on Foundations of Software Technology and Theoretical Computer Science, Lecture Notes in Computer Science
, 2002
"... We continue the study of multicast cost... ..."
Programming with Structures, Functions, and Objects
, 1991
"... We describe program structuring mechanisms for integrating algebraic, functional and objectoriented programming in a single framework. Our language is a statically typed higherorder language with specifications, structures, types, and values, and with universal and existential abstraction over stru ..."
Abstract

Cited by 1 (0 self)
 Add to MetaCart
We describe program structuring mechanisms for integrating algebraic, functional and objectoriented programming in a single framework. Our language is a statically typed higherorder language with specifications, structures, types, and values, and with universal and existential abstraction over structures, types, and values. We show that existential types over structures generalize both the necessarily homogeneous type classes of Haskell and the necessarily heterogeneous object classes of objectoriented programming languages such as C++ or Eiffel. Following recent work on ML, we provide separate linguistic mechanisms for reusing specifications and structures. Subtyping is provided in the form of explicit type conversions. The language mechanisms are introduced by examples to emphasize their pragmatic aspects. We compare them with the mechanisms of XML+, Haskell and Eiffel and give a typetheoretic perspective. These mechanisms have been developed within a larger, ongoing prototyping l...
No TwoState CA for Density Classification Exists
"... Recently there have been many attempts to evolve onedimensional twostate cellular automata which classify binary strings according to their densities of 1's and 0's. The current bestknown approaches involve particlebased systems of information transfer. A proof is given that there does not exist ..."
Abstract
 Add to MetaCart
Recently there have been many attempts to evolve onedimensional twostate cellular automata which classify binary strings according to their densities of 1's and 0's. The current bestknown approaches involve particlebased systems of information transfer. A proof is given that there does not exist a twostate CA which performs the task perfectly. 1 Introduction Since their inception, cellular automata (CA) have proven to be an extremely austere yet powerful class of algorithmic specifications. A number of investigations into the relationship between computational systems and the physical world have used CA as their foundation [3, 6, 7], so it is rea1 Land & Belew: CA Density Classification 2 sonable that recent extensions of this work to the role of evolution in the physical and computational worlds would also rely upon CA. A defining property of CA is the way in which computations depending upon and affecting an arbitrarily large global state field are defined in terms of operatio...
Prove the Existence of the Core Model in the Theory
"... ardinal, say. For some applications of the theory of K this situation is a deficiency. For example, in order to prove by the methods of [St96] that if there is a saturated ideal on # 1 then there is an inner model with a Woodin cardinal one needs the background assumption that there be a measurable ..."
Abstract
 Add to MetaCart
ardinal, say. For some applications of the theory of K this situation is a deficiency. For example, in order to prove by the methods of [St96] that if there is a saturated ideal on # 1 then there is an inner model with a Woodin cardinal one needs the background assumption that there be a measurable (or a subtle) cardinal in V (cf. [St96, Theorem 7.1]). However, we conjecture that Con(ZFC + "there is a saturated ideal on # 1 ") # Con(ZFC + "there is an inner model with a Woodin cardinal") is provable in Peano Arithmetic. The paper [Sch#] proves the existence of a universal weasel W in the theory BGC + "there's no inner model with a Woodin cardinal," where W is universal in the sense that it wins the coiteration against any coiterable (set or classsized) premouse. (In sub
2. Preliminaries 3. Learning Architectures 4. Learning as Improvement In Computational Efficiency
, 1987
"... ..."
Energy Policy] (]]]])]]]–]]] Contents lists available at ScienceDirect Energy
"... Policy journal homepage: www.elsevier.com/locate/enpol ..."