• 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 749
Next 10 →

Choosing Replica Placement Heuristics for Wide-Area Systems

by Magnus Karlsson, Christos Karamanolis - In ICDCS ’04: Proceedings of the 24th International Conference on Distributed Computing Systems (ICDCS’04 , 2004
"... Data replication is used extensively in wide-area distributed systems to achieve low data-access latency. A large number of heuristics have been proposed to perform replica placement. Practical experience indicates that the choice of heuristic makes a big difference in terms of the cost of required ..."
Abstract - Cited by 53 (0 self) - Add to MetaCart
Data replication is used extensively in wide-area distributed systems to achieve low data-access latency. A large number of heuristics have been proposed to perform replica placement. Practical experience indicates that the choice of heuristic makes a big difference in terms of the cost of required

Engineering a Scalable Placement Heuristic for DNA Probe Arrays

by A. B. Kahng, et al. , 2003
"... ... ffl We give improved dynamic programming algorithms that perform probe embedding to minimize the number border conflicts while accounting for distance- and position-dependent border conflict weights, as well as the presence of polymorphic probes in the instance. ffl We describe and experimentall ..."
Abstract - Cited by 6 (3 self) - Add to MetaCart
and experimentally validate the "engineering " of a scalable, high-quality asynchronous placement heuristic (which is moreover easily parallelizable) for DNA array design. Our heuristic is enabled by a novel approach for simultaneous re-placement and optimal reembedding of an "independent set

A New Placement Heuristic for the Orthogonal Stock-Cutting Problem

by E. K. Burke, G. Kendall, G. Whitwell , 2004
"... ..."
Abstract - Cited by 38 (4 self) - Add to MetaCart
Abstract not found

MP-DNA: A Novel Distributed Replica Placement Heuristic for WMNs*

by Zakwan Al-arnaout, Jonathan Hart, Qiang Fu, Marcus Frean
"... Abstract—Content replication and placement is an area that has been well explored in the scope of Content Delivery Networks (CDNs), but has received relatively less attention from the research community when it comes to Wireless Mesh Networks (WMNs). There are a number of Replica Placement Algorithm ..."
Abstract - Add to MetaCart
Algorithms (RPAs) that are specifically designed for CDNs. But they do not consider the special features of wireless networks. In this paper, we propose a new heuristic called MP-DNA (Multiple Partitions per Delegate Node Assignment). We study the problem of optimal content replication and placement in WMNs

Fast, Efficient Equipment Placement Heuristics for Broadband Switched or Internet Router Networks

by Joel W. Gannett
"... Planning and designing the next generation of IP router or switched broadband networks seems a daunting challenge considering the many complex, interacting factors affecting the performance and cost of such networks. Generally, this complexity implies that it may not even be clear what constitutes a ..."
Abstract - Add to MetaCart
on equipment placement with a goal of minimizing Installed First Cost. This paper reports on a heuristic approach we have implemented for this problem that has evolved out of real network design projects. A tool with both a Solution Engine and an intuitive Graphical User Interface has been developed

Timing-driven via placement heuristics for three-dimensional ICs

by Vasilis F. Pavlidis, Eby G. Friedman
"... This article appeared in a journal published by Elsevier. The attached copy is furnished to the author for internal non-commercial research and education use, including for instruction at the authors institution and sharing with colleagues. Other uses, including reproduction and distribution, or sel ..."
Abstract - Cited by 1 (1 self) - Add to MetaCart
This article appeared in a journal published by Elsevier. The attached copy is furnished to the author for internal non-commercial research and education use, including for instruction at the authors institution and sharing with colleagues. Other uses, including reproduction and distribution, or selling or licensing copies, or posting to personal, institutional or third party websites are prohibited. In most cases authors are permitted to post their version of the article (e.g. in Word or Tex form) to their personal website or institutional repository. Authors requiring further information regarding Elsevier’s archiving and manuscript policies are encouraged to visit:

ABSTRACT Engineering a Scalable Placement Heuristic for DNA Probe Arrays

by unknown authors
"... ..."
Abstract - Add to MetaCart
Abstract not found

Bio-Inspired Relay Node Placement Heuristics for Repairing Damaged Wireless Sensor Networks

by Fatih Senel, Mohamed Younis, Kemal Akkaya, See Profile, Fatih Senel, Mohamed Younis, Kemal Akkaya - IEEE Trans. Veh. Technol
"... All in-text references underlined in blue are linked to publications on ResearchGate, letting you access and read them immediately. ..."
Abstract - Cited by 5 (1 self) - Add to MetaCart
All in-text references underlined in blue are linked to publications on ResearchGate, letting you access and read them immediately.

On the Placement of Internet Instrumentation

by Jamin Jin Jin , 2000
"... The IDMaps project aims at providing a distance map of the Internet from which the relative distances between points on the Internet can be gauged [1]. Distance map is a service which many distributed systems and applications can benefit from; for example, a common method to improve user perceived p ..."
Abstract - Cited by 138 (9 self) - Add to MetaCart
both graph theoretic methods and ad hoc heuristics for instrumenting the Internet to obtain distance maps. We evaluate the efficacy of the resulting distance maps by comparing the determinations of closest replica using known topology against those obtained from the distance maps. I. INTRODUCTION

An Empirical Study of Algorithms for Point Feature Label Placement

by Jon Christensen, Joe Marks, Stuart Shieber , 1994
"... A major factor affecting the clarity of graphical displays that include text labels is the degree to which labels obscure display features (including other labels) as a result of spatial overlap. Point-feature label placement (PFLP) is the problem of placing text labels adjacent to point features on ..."
Abstract - Cited by 160 (8 self) - Add to MetaCart
A major factor affecting the clarity of graphical displays that include text labels is the degree to which labels obscure display features (including other labels) as a result of spatial overlap. Point-feature label placement (PFLP) is the problem of placing text labels adjacent to point features
Next 10 →
Results 1 - 10 of 749
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