Results 1 - 10 of 3,137

A scheduling model for reduced CPU energy

by Frances Yao, Alan Demers, Scott Shenker - ANNUAL SYMPOSIUM ON FOUNDATIONS OF COMPUTER SCIENCE , 1995
"... The energy usage of computer systems is becoming an important consideration, especially for batteryoperated systems. Various methods for reducing energy consumption have been investigated, both at the circuit level and at the operating systems level. In this paper, we propose a simple model of job s ..."
Abstract - Cited by 558 (3 self) - Add to MetaCart
an off-line algorithm that computes, for any set of jobs, a minimum-energy schedule. We then consider some on-line algorithms and their competitive performance for the power function P(s) = sp where p 3 2. It is shown that one natural heuristic, called the Average Rate heuristic, uses at most a constant

Amortized Efficiency of List Update and Paging Rules

by Daniel D. Sleator, Robert E. Tarjan , 1985
"... In this article we study the amortized efficiency of the “move-to-front” and similar rules for dynamically maintaining a linear list. Under the assumption that accessing the ith element from the front of the list takes 0(i) time, we show that move-to-front is within a constant factor of optimum amo ..."
Abstract - Cited by 824 (8 self) - Add to MetaCart
among a wide class of list maintenance rules. Other natural heuristics, such as the transpose and frequency count rules, da not share this property. We generalize our results to show that move-to-front is within a constant factor of optimum as long as the access cost is a convex function. We also study

Maximizing the Spread of Influence Through a Social Network

by David Kempe - In KDD , 2003
"... Models for the processes by which ideas and influence propagate through a social network have been studied in a number of domains, including the diffusion of medical and technological innovations, the sudden and widespread adoption of various strategies in game-theoretic settings, and the effects of ..."
Abstract - Cited by 990 (7 self) - Add to MetaCart
the first provable approximation guarantees for efficient algorithms. Using an analysis framework based on submodular functions, we show that a natural greedy strategy obtains a solution that is provably within 63 % of optimal for several classes of models; our framework suggests a general approach

Natural Heuristic Dynamic Programming for Dynamic Systems Control

by Wendy Tang Wtang, Jahangir Rastegar
"... Heuristic Dynamic Programming (HDP) is the simplest kind of Adaptive Critic [1]. It can be used to maximize or minimize any utility function, such as total energy or trajectory error, of a system over time in a noisy environment. In this article, we propose a new version of HDP, called NHDP (Natura ..."
Abstract - Add to MetaCart
(Natural Heuristic Dynamic Programming) . This new version incorporates basic HDP algorithm with the following features: (i) use of Trajectory Pattern Method to guarantee smoothness of trajectory and control signals; (ii) use multiple critic networks to localize effect of each parameter mimicing

Integration of the cognitive and the psychodynamic unconscious

by Seymour Epstein - American Psychologist , 1994
"... Cognitive-experiential self-theory integrates the cognitive and the psychodynamic unconscious by assuming the ex-istence of two parallel, interacting modes of information processing: a rational system and an emotionally driven experiential system. Support for the theory is provided by the convergenc ..."
Abstract - Cited by 477 (1 self) - Add to MetaCart
—and by laboratory research, including the prediction of new phenomena in heuristic reasoning. N early 100 years ago, Freud introduced a dualtheory of information processing that placeddeviant behavior squarely in the realm of the natural sciences and, more particularly, in psychology.

Unsupervised Learning of the Morphology of a Natural Language

by John Goldsmith - COMPUTATIONAL LINGUISTICS , 2001
"... This study reports the results of using minimum description length (MDL) analysis to model unsupervised learning of the morphological segmentation of European languages, using corpora ranging in size from 5,000 words to 500,000 words. We develop a set of heuristics that rapidly develop a probabilist ..."
Abstract - Cited by 355 (12 self) - Add to MetaCart
This study reports the results of using minimum description length (MDL) analysis to model unsupervised learning of the morphological segmentation of European languages, using corpora ranging in size from 5,000 words to 500,000 words. We develop a set of heuristics that rapidly develop a

Automatically Generating Extraction Patterns from Untagged Text

by Ellen Riloff - Department of Computer Science, Graduate School of Arts and Science, New York University , 1996
"... Many corpus-based natural language processing systems rely on text corpora that have been manually annotated with syntactic or semantic tags. In particular, all previous dictionary construction systems for information extraction have used an annotated training corpus or some form of annotated input. ..."
Abstract - Cited by 373 (32 self) - Add to MetaCart
Many corpus-based natural language processing systems rely on text corpora that have been manually annotated with syntactic or semantic tags. In particular, all previous dictionary construction systems for information extraction have used an annotated training corpus or some form of annotated input

Conservation of resources: A new attempt at conceptualizing stress

by Stevan E. Hobfoll - American Psychologist , 1989
"... ABSTRACT: Major perspectives concerning stress are presented with the goal of clarifying the nature of what has proved to be a heuristic but vague construct. Current conceptualizations ofstress are challenged as being too phenomenological and ambiguous, and consequently, not given to direct empirica ..."
Abstract - Cited by 345 (3 self) - Add to MetaCart
ABSTRACT: Major perspectives concerning stress are presented with the goal of clarifying the nature of what has proved to be a heuristic but vague construct. Current conceptualizations ofstress are challenged as being too phenomenological and ambiguous, and consequently, not given to direct

On Clusterings: Good, Bad and Spectral

by Ravi Kannan , Santosh Vempala, Adrian Vetta , 2003
"... We motivate and develop a natural bicriteria measure for assessing the quality of a clustering which avoids the drawbacks of existing measures. A simple recursive heuristic is shown to have poly-logarithmic worst-case guarantees under the new measure. The main result of the paper is the analysis of ..."
Abstract - Cited by 332 (11 self) - Add to MetaCart
We motivate and develop a natural bicriteria measure for assessing the quality of a clustering which avoids the drawbacks of existing measures. A simple recursive heuristic is shown to have poly-logarithmic worst-case guarantees under the new measure. The main result of the paper is the analysis

Improving Elevator Performance Using Reinforcement Learning

by Robert Crites, Andrew Barto - Advances in Neural Information Processing Systems 8 , 1996
"... This paper describes the application of reinforcement learning (RL) to the difficult real world problem of elevator dispatching. The elevator domain poses a combination of challenges not seen in most RL research to date. Elevator systems operate in continuous state spaces and in continuous time as d ..."
Abstract - Cited by 324 (5 self) - Add to MetaCart
noisy to each agent due to the effects of the actions of the other agents, the random nature of the arrivals and the incomplete observation of the state. In spite of these complications, we show results that in simulation surpass the best of the heuristic elevator control algorithms of which we
Results 1 - 10 of 3,137