Tools
Sorted by:
Try your query at:
 |
 |
 |
 |
 |
 |
Results 1 - 10
of
11,302
Precomputing Possible Configuration Error Diagnoses
"... Complex software packages, particularly systems software, often require substantial customization before being used. Small mistakes in configuration can lead to hard-to-diagnose error messages. We demonstrate how to build a map from each program point to the options that might cause an error at tha ..."
Abstract
-
Cited by 12 (0 self)
- Add to MetaCart
Complex software packages, particularly systems software, often require substantial customization before being used. Small mistakes in configuration can lead to hard-to-diagnose error messages. We demonstrate how to build a map from each program point to the options that might cause an error
The Player/Stage Project: Tools for Multi-Robot and Distributed Sensor Systems
- In Proceedings of the 11th International Conference on Advanced Robotics
, 2003
"... This paper describes the Player/Stage software tools applied to multi-robot, distributed-robot and sensor network systems. Player is a robot device server that provides network transparent robot control. Player seeks to constrain controller design as little as possible; it is device independent, non ..."
Abstract
-
Cited by 622 (14 self)
- Add to MetaCart
This paper describes the Player/Stage software tools applied to multi-robot, distributed-robot and sensor network systems. Player is a robot device server that provides network transparent robot control. Player seeks to constrain controller design as little as possible; it is device independent
Adaptive Constraint Satisfaction
- WORKSHOP OF THE UK PLANNING AND SCHEDULING
, 1996
"... Many different approaches have been applied to constraint satisfaction. These range from complete backtracking algorithms to sophisticated distributed configurations. However, most research effort in the field of constraint satisfaction algorithms has concentrated on the use of a single algorithm fo ..."
Abstract
-
Cited by 952 (43 self)
- Add to MetaCart
Many different approaches have been applied to constraint satisfaction. These range from complete backtracking algorithms to sophisticated distributed configurations. However, most research effort in the field of constraint satisfaction algorithms has concentrated on the use of a single algorithm
Weighted Voting for Replicated Data
, 1979
"... In a new algorithm for maintaining replicated data, every copy of a replicated file is assigned some number of votes. Every transaction collects a read quorum of r votes to read a file, and a write quorum of w votes to write a file, such that r+w is greater than the total number number of votes assi ..."
Abstract
-
Cited by 598 (0 self)
- Add to MetaCart
assigned to the file. This ensures that there is a non-null intersection between every read quorum and every write quorum. Version numbers make it possible to determine which copies are current. The reliability and performance characteristics of a replicated file can be controlled by appropriately choosing
Simultaneous Multithreading: Maximizing On-Chip Parallelism
, 1995
"... This paper examines simultaneous multithreading, a technique permitting several independent threads to issue instructions to a superscalar’s multiple functional units in a single cycle. We present several models of simultaneous multithreading and compare them with alternative organizations: a wide s ..."
Abstract
-
Cited by 823 (48 self)
- Add to MetaCart
multithreading has the potential to achieve 4 times the throughput of a superscalar, and double that of fine-grain multithreading. We evaluate several cache configurations made possible by this type of organization and evaluate tradeoffs between them. We also show that simultaneous multithreading
Macroscopic strings as heavy quarks in large N gauge theory and Anti-de Sitter supergravity
- PHYS. J. C22
"... Maldacena has put forward large N correspondence between superconformal field theories on the brane and anti-de Sitter supergravity in spacetime. We study some aspects of the correspondence between N = 4 superconformal gauge theory on D3-brane and maximal supergravity on adS5 × S5 by introducing mac ..."
Abstract
-
Cited by 508 (1 self)
- Add to MetaCart
for macroscopic string in anti-de Sitter supergravity. As a by-product we clarify how Polchinski’s Dirichlet and Neumann open string boundary conditions arise. We then study non-BPS macroscopic string anti-string pair configuration as physical realization of heavy quark Wilson loop. We obtain Q ¯ Q static
A spatial nine-bar linkage, possible configurations and conditions for paradoxical mobility
- 13th National Conference on Mechanisms and Machines (NaCoMM07
, 2007
"... Abstract This paper is about a linkage consisting of nine bars connected by spherical joints, where the bars form a spatial hexagon with its main diagonals. Additionally the supporting lines of the diagonals have one proper point in common. This linkage is rigid in general. Wunderlich ..."
Abstract
-
Cited by 2 (0 self)
- Add to MetaCart
Abstract This paper is about a linkage consisting of nine bars connected by spherical joints, where the bars form a spatial hexagon with its main diagonals. Additionally the supporting lines of the diagonals have one proper point in common. This linkage is rigid in general. Wunderlich
Possible configurations of the magnetic field in the outer magnetosphere during geomagnetic polarity reversals
, 2000
"... ..."
A rigorous study of possible configurations of limit cycles bifurcating
, 2008
"... Publication details, including instructions for authors and subscription information: ..."
Abstract
- Add to MetaCart
Publication details, including instructions for authors and subscription information:
Integrated coverage and connectivity configuration in wireless sensor networks
- In SenSys ’03: Proceedings of the 1st international
, 2003
"... An effective approach for energy conservation in wireless sensor networks is scheduling sleep intervals for extraneous nodes, while the remaining nodes stay active to provide continuous service. For the sensor network to operate successfully, the active nodes must maintain both sensing coverage and ..."
Abstract
-
Cited by 314 (16 self)
- Add to MetaCart
. This flexibility allows the network to self-configure for a wide range of applications and (possibly dynamic) environments. 2) We provide a geometric analysis of the relationship between coverage and connectivity. This analysis yields key insights for treating coverage and connectivity in a unified framework
Results 1 - 10
of
11,302
