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

CiteSeerX logo

Tools

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

Indicators for Social and Economic Coping Capacity - Moving Toward a Working Definition of Adaptive Capacity”, Wesleyan-CMU Working Paper.

by Gary Yohe , Richard S J Tol , Gary Yohe , 2001
"... Abstract This paper offers a practically motivated method for evaluating systems' abilities to handle external stress. The method is designed to assess the potential contributions of various adaptation options to improving systems' coping capacities by focusing attention directly on the u ..."
Abstract - Cited by 109 (14 self) - Add to MetaCart
Abstract This paper offers a practically motivated method for evaluating systems' abilities to handle external stress. The method is designed to assess the potential contributions of various adaptation options to improving systems' coping capacities by focusing attention directly

Object/relational query optimization with chase

by Lucian Popa
"... and backchase ..."
Abstract - Add to MetaCart
and backchase

1ROBUST ADAPTIVE BEAMFORMER WITH A LARGE CONTROLLED MAINLOBE

by Z. L. Yu, Z. Gu, Y. Li, W. Ser, M. H. Er
"... Abstract — Many advanced adaptive beamformers are robust against arbitrary array steering vector (ASV) mismatches within a presumed uncertainty set. Adaptive array tolerating significant steering direction error usually requires a large size of ASV uncertainty set. In such case, however, the output ..."
Abstract - Add to MetaCart
robust adaptive beamformer is derived based on this new ASV uncertainty set. To eliminate the non-convex constraint on array magnitude response, we force the real part of array response to exceed unity regarding the ASVs within the uncertainty set. Furthermore, using the worst-case optimization technique

An adaptive algorithm selection framework

by Hao Yu, Dongmin Zhang, Francis Dang, Lawrence Rauchwerger - In PACT ’04: Proceedings of the 13th International Conference on Parallel Architectures and Compilation Techniques , 2004
"... Irregular and dynamic memory reference patterns can cause performance variations for low level algorithms in general and for parallel algorithms in particular. We have previously shown that parallel algorithms (reductions, sorting) are input sensitive and can benefit from adaptation to their inputs ..."
Abstract - Cited by 13 (1 self) - Add to MetaCart
the performance is still within 2 % of the optimal scheme’s performance. (c) Adaptively selects the best algorithms for each phase of a dynamic program resulting in better overall performance (d) Adapts to the underlying machine architecture. (tested on IBM Regatta and HP V-Class).

CERTIFICATE OF APPROVAL

by Yunlong Liu, Yunlong Liu, Erwei Bai, Mona K. Garvin, Hantao Zhang , 2014
"... Treatment plan optimization for rotating-shield brachytherapy ..."
Abstract - Add to MetaCart
Treatment plan optimization for rotating-shield brachytherapy

QOS WITH RELIABILITY AND SCALABILITY IN ADAPTIVE SERVICE-BASED SYSTEMS

by V. Rhymend, Uthariaraj P. Mercy, Florence A. Geetha
"... Service-based systems that are dynamically composed at runtime to provide complex, adaptive functionality are currently one of the main development paradigms in software engineering. However, the Quality of Service (QoS) delivered by these systems remains an important concern, and needs to be manage ..."
Abstract - Add to MetaCart
to be managed in an equally adaptive and predictable way. To address this need, we introduce a novel, tool-supported framework for the development of adaptive servicebased systems called QoSMOS (QoS Management and Optimization of Service-based systems). QoSMOS can be used to develop service-based systems

4. TITLE AND SUBTITLE A Practical Theory of Micro-Solar Power Sensor Networks

by Jaein Jeong , 2009
"... Public reporting burden for the collection of information is estimated to average 1 hour per response, including the time for reviewing instructions, searching existing data sources, gathering and maintaining the data needed, and completing and reviewing the collection of information. Send comments ..."
Abstract - Add to MetaCart
Public reporting burden for the collection of information is estimated to average 1 hour per response, including the time for reviewing instructions, searching existing data sources, gathering and maintaining the data needed, and completing and reviewing the collection of information. Send comments

1Sub-Nyquist Sampling: Bridging Theory and Practice

by Moshe Mishali, Yonina C. Eldar
"... [ A review of past and recent strategies for sub-Nyquist sampling] Signal processing methods have changed substantially over the last several decades. In modern applications, an increasing number of functions is being pushed forward to sophisticated software algorithms, leaving only delicate finely- ..."
Abstract - Add to MetaCart
statement which has had one of the most profound impacts on industrial development of digital signal processing (DSP) systems. Over the years, theory and practice in the field of sampling have developed in parallel routes. Contributions by many research groups suggest a multitude of methods, other than

Generalized Louvain method for community detection in large networks

by unknown authors
"... Abstract—In this paper we present a novel strategy to discover the community structure of (possibly, large) networks. This approach is based on the well-know concept of network modularity optimization. To do so, our algorithm exploits a novel measure of edge centrality, based on the κ-paths. This te ..."
Abstract - Add to MetaCart
Abstract—In this paper we present a novel strategy to discover the community structure of (possibly, large) networks. This approach is based on the well-know concept of network modularity optimization. To do so, our algorithm exploits a novel measure of edge centrality, based on the κ

Generalized Louvain Method for Community Detection in Large Networks

by unknown authors
"... Abstract—In this paper we present a novel strategy to discover the community structure of (possibly, large) networks. This approach is based on the well-know concept of network modularity optimization. To do so, our algorithm exploits a novel measure of edge centrality, based on the κ-paths. This te ..."
Abstract - Add to MetaCart
Abstract—In this paper we present a novel strategy to discover the community structure of (possibly, large) networks. This approach is based on the well-know concept of network modularity optimization. To do so, our algorithm exploits a novel measure of edge centrality, based on the κ
Next 10 →
Results 1 - 10 of 218
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