• 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 6,880
Next 10 →

A Resource Management Architecture for Metacomputing Systems

by Karl Czajkowski , Ian Foster, Nick Karonis, Carl Kesselman, Stuart Martin, Warren Smith, Steven Tuecke , 1997
"... Metacomputing systems are intended to support remote and/or concurrent use of geographically distributed computational resources. Resource management in such systems is complicated by five concerns that do not typically arise in other situations: site autonomy and heterogeneous substrates at the ..."
Abstract - Cited by 462 (45 self) - Add to MetaCart
at the resources, and application requirements for policy extensibility, co-allocation, and online control. We describe a resource management architecture that addresses these concerns. This architecture distributes the resource management problem among distinct local manager, resource broker, and resource co

Development; *Library Policy; Online Catalogs

by Barbara B
"... This report discusses the government documents policies and procedures of Illinois State University's Milner Library, a federal depository library. The following aspects of the documents collection are outlined: federal depository status; bibliographic control; maintenance; human resources; phy ..."
Abstract - Add to MetaCart
This report discusses the government documents policies and procedures of Illinois State University's Milner Library, a federal depository library. The following aspects of the documents collection are outlined: federal depository status; bibliographic control; maintenance; human resources

Off-Policy Online Backwards Replay

by Stuart I. Reynolds
"... Backwards replay is a brilliantly simple idea that most researchers currently regard to be an offline reinforcement learning technique. ..."
Abstract - Add to MetaCart
Backwards replay is a brilliantly simple idea that most researchers currently regard to be an offline reinforcement learning technique.

Internet paradox: A social technology that reduces social involvement and psychological well-being

by Robert Kraut, Michael Patterson, Vicki Lundmark, Sara Kiesler, Tridas Mukopadhyay, William Scherlis - American Psychologist , 1998
"... The Internet could change the lives of average citizens as much as did the telephone in the early part of the 20th century and television in the 1950s and 1960s. Researchers and social critics are debating whether the Internet is improving or harming participation in community life and social relati ..."
Abstract - Cited by 362 (18 self) - Add to MetaCart
relationships. This research examined the social and psychological impact of the lnternet on 169 people in 73 households during their first i to 2 years on-line. We used longitudinal data to examine the effects of the Internet on social involvement and psychological well-being. In this sample, the Internet

Series 2000: Instruction Policy Online Learning – 2024

by Cross References , 2011
"... The Issaquah School District believes that a variety of learning options, including online courses and programs, are critical for 21st Century learners. The District recognizes that the online learning environment provides students with unique opportunities to become self-disciplined learners with l ..."
Abstract - Add to MetaCart
this policy. The procedures will include, but not be limited to, a description of student access to online learning courses/programs, student eligibility criteria, the types of online courses available to students, methods the district will use to support student success, payment of course fees and other

Cache Decay: Exploiting Generational Behavior to Reduce Cache Leakage Power

by Stefanos Kaxiras, Zhigang Hu, Margaret Martonosi - in Proceedings of the 28th International Symposium on Computer Architecture , 2001
"... Power dissipation is increasingly important in CPUs ranging from those intended for mobile use, all the way up to highperformance processors for high-end servers. While the bulk of the power dissipated is dynamic switching power, leakage power is also beginning to be a concern. Chipmakers expect tha ..."
Abstract - Cited by 280 (26 self) - Add to MetaCart
. Because our decay-based techniques have notions of competitive on-line algorithms at their roots, their energy usage can be theoretically bounded at within a factor of two of the optimal oraclebased policy. We also examine adaptive decay-based policies that make energy-minimizing policy choices on a per

Transmission with energy harvesting nodes in fading wireless channels: Optimal policies

by Omur Ozel, Kaya Tutuncuoglu, Jing Yang, Sennur Ulukus, Aylin Yener - IEEE JOURNAL ON SELECTED AREAS IN COMMUNICATIONS , 2011
"... Wireless systems comprised of rechargeable nodes have a significantly prolonged lifetime and are sustainable. A distinct characteristic of these systems is the fact that the nodes can harvest energy throughout the duration in which communication takes place. As such, transmission policies of the nod ..."
Abstract - Cited by 179 (46 self) - Add to MetaCart
by utilizing its equivalence to its throughput maximization counterpart. Next, we consider online policies. We use stochastic dynamic programming to solve for the optimal online policy that maximizes the average number of bits delivered by a deadline under stochastic fading and energy arrival processes

Energy Consumption in Mobile Phones: A Measurement Study and Implications for Network Applications

by Niranjan Balasubramanian, Aruna Balasubramanian, Arun Venkataramani , 2009
"... In this paper, we present a measurement study of the energy consumption characteristics of three widespread mobile networking technologies: 3G, GSM, and WiFi. We find that 3G and GSM incur a high tail energy overhead because of lingering in high power states after completing a transfer. Based on the ..."
Abstract - Cited by 221 (2 self) - Add to MetaCart
as to minimize the cumulative energy consumed while meeting user-specified deadlines. We show that the TailEnder scheduling algorithm is within a factor 2 × of the optimal and show that any online algorithm can at best be within a factor 1.62 × of the optimal. For applications like web search that can benefit

Movement Imitation with Nonlinear Dynamical Systems in Humanoid Robots

by Auke Jan Ijspeert, Jun Nakanishi, Stefan Schaal - In IEEE International Conference on Robotics and Automation (ICRA2002 , 2002
"... This article presents a new approach to movement planning, on-line trajectory modification, and imitation learning by representing movement plans based on a set of nonlinear di#erential equations with well-defined attractor dynamics. In contrast to non-autonomous movement representations like spline ..."
Abstract - Cited by 204 (26 self) - Add to MetaCart
splines, the resultant movement plan remains an autonomous set of nonlinear di#erential equations that forms a control policy (CP) which is robust to strong external perturbations and that can be modified on-line by additional perceptual variables. The attractor landscape of the control policy can

Fast evaluation of quadratic control-Lyapunov policy [Online]. Available: http://stanford.edu/~boyd/papers/fast_clf.html

by Yang Wang, Stephen Boyd , 2009
"... Abstract—The evaluation of a control-Lyapunov policy, with quadratic Lyapunov function, requires the solution of a quadratic program (QP) at each time step. For small problems this QP can be solved explicitly; for larger problems an online optimization method can be used. For this reason the control ..."
Abstract - Cited by 8 (5 self) - Add to MetaCart
Abstract—The evaluation of a control-Lyapunov policy, with quadratic Lyapunov function, requires the solution of a quadratic program (QP) at each time step. For small problems this QP can be solved explicitly; for larger problems an online optimization method can be used. For this reason
Next 10 →
Results 1 - 10 of 6,880
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