• 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 11 - 20 of 14,738
Next 10 →

Congestion control for high bandwidth-delay product networks

by Dina Katabi, Mark Handley, Charlie Rohrs - SIGCOMM '02 , 2002
"... Theory and experiments show that as the per-flow product of bandwidth and latency increases, TCP becomes inefficient and prone to instability, regardless of the queuing scheme. This failing becomes increasingly important as the Internet evolves to incorporate very high-bandwidth optical links and mo ..."
Abstract - Cited by 454 (4 self) - Add to MetaCart
and more large-delay satellite links. To address this problem, we develop a novel approach to Internet congestion control that outperforms TCP in conventional environments, and remains efficient, fair, scalable, and stable as the bandwidth-delay product increases. This new eXplicit Control Protocol, XCP

A simple cooperative diversity method based on network path selection

by Aggelos Bletsas, Ashish Khisti, David P. Reed, Andrew Lippman - IEEE J. SELECT. AREAS COMMUN , 2006
"... Cooperative diversity has been recently proposed as a way to form virtual antenna arrays that provide dramatic gains in slow fading wireless environments. However, most of the proposed solutions require distributed space–time coding algorithms, the careful design of which is left for future investi ..."
Abstract - Cited by 452 (14 self) - Add to MetaCart
Cooperative diversity has been recently proposed as a way to form virtual antenna arrays that provide dramatic gains in slow fading wireless environments. However, most of the proposed solutions require distributed space–time coding algorithms, the careful design of which is left for future

Using occupancy grids for mobile robot perception and navigation

by Albert Elfes - Computer , 1989
"... o widen the range of application and deployment of robots, both in research and in industrial contexts, we need to develop more powerful and flexible robotic systems exhibiting higher degrees of autonomy and able to sense, plan, and operate in unstructured environments. For that, the robot must be a ..."
Abstract - Cited by 438 (4 self) - Add to MetaCart
o widen the range of application and deployment of robots, both in research and in industrial contexts, we need to develop more powerful and flexible robotic systems exhibiting higher degrees of autonomy and able to sense, plan, and operate in unstructured environments. For that, the robot must

Implementation issues in spectrum sensing for cognitive radios

by Danijela Cabric, Shridhar Mubaraq Mishra, Robert W. Brodersen - in Proc. the 38th. Asilomar Conference on Signals, Systems, and Computers , 2004
"... Abstract- There are new system implementation challenges involved in the design of cognitive radios, which have both the ability to sense the spectral environment and the flexibility to adapt transmission parameters to maximize system capacity while co-existing with legacy wireless networks. The cri ..."
Abstract - Cited by 440 (7 self) - Add to MetaCart
Abstract- There are new system implementation challenges involved in the design of cognitive radios, which have both the ability to sense the spectral environment and the flexibility to adapt transmission parameters to maximize system capacity while co-existing with legacy wireless networks

Rivet: A Flexible Environment for Computer Systems Visualization

by Robert Bosch, Chris Stolte, Diane Tang, John Gerth, Mendel Rosenblum, Pat Hanrahan - Computer Graphics , 2000
"... Rivet is a visualization system for the study of complex computer systems. Since computer systems analysis and visualization is an unpredictable and iterative process, a key design goal of Rivet is to support the rapid development of interactive visualizations capable of visualizing large data sets. ..."
Abstract - Cited by 47 (4 self) - Add to MetaCart
. In this paper, we present Rivet's architecture, focusing on its support for varied data sources, interactivity, composition and user-defined data transformations. We also describe the challenges of implementing this architecture efficiently and flexibly. We conclude with several examples of computer

Matchmaking: Distributed Resource Management for High Throughput Computing

by Rajesh Raman, Miron Livny, Marvin Solomon - In Proceedings of the Seventh IEEE International Symposium on High Performance Distributed Computing , 1998
"... Conventional resource management systems use a system model to describe resources and a centralized scheduler to control their allocation. We argue that this paradigm does not adapt well to distributed systems, particularly those built to support high-throughput computing. Obstacles include heteroge ..."
Abstract - Cited by 435 (20 self) - Add to MetaCart
heterogeneity of resources, which make uniform allocation algorithms difficult to formulate, and distributed ownership, leading to widely varying allocation policies. Faced with these problems, we developed and implemented the classified advertisement (classad) matchmaking framework, a flexible and general

Eddies: Continuously Adaptive Query Processing

by Ron Avnur, Joseph M. Hellerstein - In SIGMOD , 2000
"... In large federated and shared-nothing databases, resources can exhibit widely fluctuating characteristics. Assumptions made at the time a query is submitted will rarely hold throughout the duration of query processing. As a result, traditional static query optimization and execution techniques are i ..."
Abstract - Cited by 411 (21 self) - Add to MetaCart
are ineffective in these environments. In this paper we introduce a query processing mechanism called an eddy, which continuously reorders operators in a query plan as it runs. We characterize the moments of symmetry during which pipelined joins can be easily reordered, and the synchronization barriers

Flexible Update Propagation for Weakly Consistent Replication

by Karin Petersen, Mike J. Spreitzer , Douglas B. Terry , Marvin M. Theimer, Alan J. Demers
"... Bayou’s anti-entropy protocol for update propagation between weakly consistent storage replicas is based on pair-wise communication, the propagation of write operations, and a set of ordering and closure constraints on the propagation of the writes. The simplicity of the design makes the protocol ve ..."
Abstract - Cited by 327 (11 self) - Add to MetaCart
very flexible, thereby providing support for diverse networking environments and usage scenarios. It accommodates a variety of policies for when and where to propagate updates. It operates over diverse network topologies, including low-bandwidth links. It is incremental. It enables replica convergence

A Flexible Environment for Building Task Models

by Cécile Paris, Jean-Claude Tarby, Keith Vander Linden , 2001
"... ..."
Abstract - Cited by 8 (2 self) - Add to MetaCart
Abstract not found

Modelling and Solving Fleet Assignment in a Flexible Environment

by Hani El Sakkout
"... This paper reports on the modelling and solution of a large industrial combinatorial optimization problem using the ECL i PS e Constraint Logic Programming (CLP) platform. The problem is fleet assignment: the assignment of a set of aircraft of different types to a predefined shedule of flights. ..."
Abstract - Cited by 1 (0 self) - Add to MetaCart
This paper reports on the modelling and solution of a large industrial combinatorial optimization problem using the ECL i PS e Constraint Logic Programming (CLP) platform. The problem is fleet assignment: the assignment of a set of aircraft of different types to a predefined shedule of flights. A single underlying model was developed and solved in ECL i PS e . Three optimization methods were applied in three stages of model development and solution. The three methods were used to meet different objectives. The first was depth first search branch and bound optimization in conjunction with Finite Domain propagation. This straightforward approach was used to develop and validate the model in the ECL i PS e platform. The second was mixed integer programming. The CLP model and solutions were exported to a mathematical solver and used to produce a globally optimal solution. Knowing the optimal solution is desirable, however obtaining good solutions close to the user's actual assi...
Next 10 →
Results 11 - 20 of 14,738
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