Tools
Sorted by:
Try your query at:
 |
 |
 |
 |
 |
 |
Results 1 - 10
of
7,607
Minimum energy mobile wireless networks
- IEEE JOURNAL ON SELECTED AREAS IN COMMUNICATIONS
, 1999
"... We describe a distributed position-based network protocol optimized for minimum energy consumption in mobile wireless networks that support peer-to-peer communications. Given any number of randomly deployed nodes over an area, we illustrate that a simple local optimization scheme executed at each n ..."
Abstract
-
Cited by 749 (0 self)
- Add to MetaCart
We describe a distributed position-based network protocol optimized for minimum energy consumption in mobile wireless networks that support peer-to-peer communications. Given any number of randomly deployed nodes over an area, we illustrate that a simple local optimization scheme executed at each
Timing-Sync Protocol for Sensor Networks
- The First ACM Conference on Embedded Networked Sensor System (SenSys
, 2003
"... Wireless ad-hoc sensor networks have emerged as an interesting and important research area in the last few years. The applications envisioned for such networks require collaborative execution of a distributed task amongst a large set of sensor nodes. This is realized by exchanging messages that are ..."
Abstract
-
Cited by 515 (8 self)
- Add to MetaCart
Wireless ad-hoc sensor networks have emerged as an interesting and important research area in the last few years. The applications envisioned for such networks require collaborative execution of a distributed task amongst a large set of sensor nodes. This is realized by exchanging messages
Self-Similarity in World Wide Web Traffic: Evidence and Possible Causes
, 1996
"... Recently the notion of self-similarity has been shown to apply to wide-area and local-area network traffic. In this paper we examine the mechanisms that give rise to the self-similarity of network traffic. We present a hypothesized explanation for the possible self-similarity of traffic by using a p ..."
Abstract
-
Cited by 1416 (26 self)
- Add to MetaCart
Recently the notion of self-similarity has been shown to apply to wide-area and local-area network traffic. In this paper we examine the mechanisms that give rise to the self-similarity of network traffic. We present a hypothesized explanation for the possible self-similarity of traffic by using a
CLAP: Recording Local Executions to Reproduce Concurrency Failures
"... We present CLAP, a new technique to reproduce concurrency bugs. CLAP has two key steps. First, it logs thread local execution paths at runtime. Second, offline, it computes memory dependencies that accord with the logged execution and are able to reproduce the observed bug. The second step works by ..."
Abstract
-
Cited by 14 (3 self)
- Add to MetaCart
We present CLAP, a new technique to reproduce concurrency bugs. CLAP has two key steps. First, it logs thread local execution paths at runtime. Second, offline, it computes memory dependencies that accord with the logged execution and are able to reproduce the observed bug. The second step works
An efficient algorithm for exploiting multiple arithmetic units
- IBM JOURNAL OF RESEARCH AND DEVELOPMENT
, 1967
"... This paper describes the methods employed in the floating-point area of the System/360 Model 91 to exploit the existence of multiple execution units. Basic to these techniques is a simple common data busing and register tagging scheme which permits simultaneous execution of independent instructions ..."
Abstract
-
Cited by 391 (1 self)
- Add to MetaCart
optimizes the program execution on a local basis. The application of these techniques is not limited to floating-point arithmetic or System/360 architecture. It may be used in almost any computer having multiple execution units and one or more 'accumulators.' Both of the execution units, as well
Robot Motion Planning: A Distributed Representation Approach
, 1991
"... We propose a new approach to robot path planning that consists of building and searching a graph connecting the local minima of a potential function defined over the robot’s configuration space. A planner based on this approach has been implemented. This planner is considerably faster than previous ..."
Abstract
-
Cited by 402 (26 self)
- Add to MetaCart
of these techniques is a Monte Carlo technique that escapes local minima by executing Brownian motions. The overall approach is made possible by the systematic use of distributed representations (bitmaps) for the robot’s work space and configuration space. We have experimented with the planner using several computer
Efficient Processing of Spatial Joins Using R-Trees
, 1993
"... Abstract: In this paper, we show that spatial joins are very suitable to be processed on a parallel hardware platform. The parallel system is equipped with a so-called shared virtual memory which is well-suited for the design and implementation of parallel spatial join algorithms. We start with an a ..."
Abstract
-
Cited by 363 (14 self)
- Add to MetaCart
with an algorithm that consists of three phases: task creation, task assignment and parallel task execu-tion. In order to reduce CPU- and I/O-cost, the three phases are processed in a fashion that pre-serves spatial locality. Dynamic load balancing is achieved by splitting tasks into smaller ones and reassigning
Action observation activates premotor and parietal areas in a somatotopic manner: an fMRI study
, 2001
"... Functional magnetic resonance imaging (fMRI) was used to localize brain areas that were active during the observation of actions made by another individual. Object- and non-object-related actions made with different effectors (mouth, hand and foot) were presented. Observation of both object- and non ..."
Abstract
-
Cited by 364 (31 self)
- Add to MetaCart
Functional magnetic resonance imaging (fMRI) was used to localize brain areas that were active during the observation of actions made by another individual. Object- and non-object-related actions made with different effectors (mouth, hand and foot) were presented. Observation of both object
Cobra: Fine-grained Malware Analysis using Stealth Localized-Executions
- In Proceedings of 2006 IEEE Symposium on Security and Privacy (Oakland’06
, 2006
"... Fine-grained code analysis in the context of malware is a complex and challenging task that provides insight into malware code-layers (polymorphic/metamorphic), its data encryption/decryption engine, its memory-layout etc., important pieces of information that can be used to detect and counter the m ..."
Abstract
-
Cited by 31 (1 self)
- Add to MetaCart
operating systems. Cobra cannot be detected or countered and can be dynamically and selectively deployed on malware specific code-streams while allowing other code-streams to execute as is. We also illustrate the framework utility by describing our experience with a tool employing Cobra to analyze a real
Visualization of test information to assist fault localization
- In ICSE ’02: Proceedings of the 24th International Conference on Software Engineering
, 2002
"... ABSTRACT One of the most expensive and time-consuming components of the debugging process is locating the errors or faults. To locate faults, developers must identify statements involved in failures and select suspicious statements that might contain faults. This paper presents a new technique that ..."
Abstract
-
Cited by 292 (14 self)
- Add to MetaCart
that uses visualization to assist with these tasks. The technique uses color to visually map the participation of each program statement in the outcome of the execution of the program with a test suite, consisting of both passed and failed test cases. Based on this visual mapping, a user can inspect
Results 1 - 10
of
7,607
