• Documents
  • Authors
  • Tables
  • Log in
  • Sign up
  • MetaCart
  • DMCA
  • Donate

CiteSeerX logo

Advanced Search Include Citations

Tools

Sorted by:
Try your query at:
Semantic Scholar Scholar Academic
Google Bing DBLP
Results 1 - 10 of 4,170
Next 10 →

An Overview of Evolutionary Algorithms in Multiobjective Optimization

by Carlos M. Fonseca, Peter J. Fleming - Evolutionary Computation , 1995
"... The application of evolutionary algorithms (EAs) in multiobjective optimization is currently receiving growing interest from researchers with various backgrounds. Most research in this area has understandably concentrated on the selection stage of EAs, due to the need to integrate vectorial performa ..."
Abstract - Cited by 492 (13 self) - Add to MetaCart
performance measures with the inherently scalar way in which EAs reward individual performance, i.e., number of offspring. In this review, current multiobjective evolutionary approaches are discussed, ranging from the conventional analytical aggregation of the different objectives into a single function to a

The effect of bonus schemes on accounting decisions.‟

by Paul M Healy - Journal of Accounting and Economics, , 1985
"... Studies examining managerial accounting decisions postulate that executives rewarded by earnings-based bonuses select accounting procedures that increase their compensation. The empirical results of these studies are conflicting. This paper analyzes the format of typical bonus contracts, providing ..."
Abstract - Cited by 401 (1 self) - Add to MetaCart
Studies examining managerial accounting decisions postulate that executives rewarded by earnings-based bonuses select accounting procedures that increase their compensation. The empirical results of these studies are conflicting. This paper analyzes the format of typical bonus contracts, providing

Motivated Reinforcement Learning

by Peter Dayan , 2001
"... The standard reinforcement learning view of the involvement of neuromodulatory systems in instrumental conditioning includes a rather straightforward conception of motivation as prediction of sum future reward. Competition between actions is based on the motivating characteristics of their consequen ..."
Abstract - Cited by 332 (15 self) - Add to MetaCart
The standard reinforcement learning view of the involvement of neuromodulatory systems in instrumental conditioning includes a rather straightforward conception of motivation as prediction of sum future reward. Competition between actions is based on the motivating characteristics

Do Women Shy Away from Competition? Do Men Compete too Much?

by Muriel Niederle, Lise Vesterlund , 2006
"... We examine whether men and women of the same ability differ in their selection into a competitive environment. Participants in a laboratory experiment solve a real task, first under a non-competitive piece rate and then a competitive tournament incentive scheme. Although there are no gender differen ..."
Abstract - Cited by 294 (14 self) - Add to MetaCart
We examine whether men and women of the same ability differ in their selection into a competitive environment. Participants in a laboratory experiment solve a real task, first under a non-competitive piece rate and then a competitive tournament incentive scheme. Although there are no gender

Approximating the nondominated front using the Pareto Archived Evolution Strategy

by Joshua D. Knowles, David W. Corne - EVOLUTIONARY COMPUTATION , 2000
"... We introduce a simple evolution scheme for multiobjective optimization problems, called the Pareto Archived Evolution Strategy (PAES). We argue that PAES may represent the simplest possible nontrivial algorithm capable of generating diverse solutions in the Pareto optimal set. The algorithm, in its ..."
Abstract - Cited by 321 (19 self) - Add to MetaCart
We introduce a simple evolution scheme for multiobjective optimization problems, called the Pareto Archived Evolution Strategy (PAES). We argue that PAES may represent the simplest possible nontrivial algorithm capable of generating diverse solutions in the Pareto optimal set. The algorithm, in its

An Evaluation of Directory Schemes for Cache Coherence

by Anant Agarwal, Richard Simoni, John Hennessy, Mark Horowitz - In Proceedings of the 15th Annual International Symposium on Computer Architecture , 1988
"... The problem of cache coherence in shared-memory multiprocessors has been addressed using two basic approaches: directory schemes and snoopy cache schemes. Directory schemes have been given less attention in the past several years, while snoopy cache methods have become extremely popular. Directory s ..."
Abstract - Cited by 257 (19 self) - Add to MetaCart
schemes for cache coherence are potentially attractive in large multiprocessor systems that are beyond the scaling limits of the snoopy cache schemes. Slight modifications to directory schemes can make them competitive in performance with snoopy cache schemes for small multiprocessors. Trace driven

Chosen-Ciphertext Security from Identity-Based Encryption. Adv

by Dan Boneh, Ran Canetti, Shai Halevi, Jonathan Katz - in Cryptology — Eurocrypt 2004, LNCS , 2004
"... We propose simple and efficient CCA-secure public-key encryption schemes (i.e., schemes secure against adaptive chosen-ciphertext attacks) based on any identity-based encryption (IBE) scheme. Our constructions have ramifications of both theoretical and practical interest. First, our schemes give a n ..."
Abstract - Cited by 280 (13 self) - Add to MetaCart
new paradigm for achieving CCA-security; this paradigm avoids “proofs of well-formedness ” that have been shown to underlie previous constructions. Second, instantiating our construction using known IBE constructions we obtain CCA-secure encryption schemes whose performance is competitive

Efficient Content Location Using Interest-Based Locality in Peer-to-Peer Systems

by Kunwadee Sripanidkulchai, Bruce Maggs, Hui Zhang , 2003
"... Locating content in decentralized peer-to-peer systems is a challenging problem. Gnutella, a popular file-sharing application, relies on flooding queries to all peers. Although flooding is simple and robust, it is not scalable. In this paper, we explore how to retain the simplicity of Gnutella, whil ..."
Abstract - Cited by 290 (2 self) - Add to MetaCart
competitive solution. In addition, shortcuts are modular and can be used to improve the performance of other content location mechanisms including distributed hash table schemes.

Scalable routing strategies for ad hoc wireless networks

by Atsushi Iwata, Ching-chuan Chiang, Guangyu Pei, Mario Gerla, Tsu-wei Chen - IEEE JSAC , 1999
"... In this paper, we consider a large population of mobile stations that are interconnected by a multihop wireless network. The applications of this wireless infrastructure range from ad hoc networking (e.g., collaborative, distributed computing) to disaster recovery (e.g., fire, flood, earthquake), l ..."
Abstract - Cited by 261 (15 self) - Add to MetaCart
) and hierarchical state routing (HSR)—which offer some competitive advantages over the existing schemes. We compare the performance of existing and proposed schemes via simulation.

Nonlinear Neural Networks: Principles, Mechanisms, and Architectures

by Stephen Grossberg , 1988
"... An historical discussion is provided of the intellectual trends that caused nineteenth century interdisciplinary studies of physics and psychobiology by leading scientists such as Helmholtz, Maxwell, and Mach to splinter into separate twentieth-century scientific movements. The nonlinear, nonstatio ..."
Abstract - Cited by 262 (21 self) - Add to MetaCart
-Schuster models. A Liapunov functional method is described for proving global limit or oscillation theorems for nonlinear competitive systems when their decision schemes are globally consistent or inconsistent, respectively. The former case is illustrated by a model of a globally stable economic market
Next 10 →
Results 1 - 10 of 4,170
Powered by: Apache Solr
  • About CiteSeerX
  • Submit and Index Documents
  • Privacy Policy
  • Help
  • Data
  • Source
  • Contact Us

Developed at and hosted by The College of Information Sciences and Technology

© 2007-2019 The Pennsylvania State University