Results 1  10
of
798
ASCENT: Adaptive selfconfiguring sensor networks topologies
, 2004
"... Advances in microsensor and radio technology will enable small but smart sensors to be deployed for a wide range of environmental monitoring applications. The low pernode cost will allow these wireless networks of sensors and actuators to be densely distributed. The nodes in these dense networks w ..."
Abstract

Cited by 449 (15 self)
 Add to MetaCart
Advances in microsensor and radio technology will enable small but smart sensors to be deployed for a wide range of environmental monitoring applications. The low pernode cost will allow these wireless networks of sensors and actuators to be densely distributed. The nodes in these dense networks
Dense packing on uniform lattices
 J. of Stat. Phys
"... We study the Hard Core Model on the graphs G obtained from Archimedean tilings i.e. configurations in {0,1} G with the nearest neighbor 1’s forbidden. Our particular aim in choosing these graphs is to obtain insight to the geometry of the densest packings in a uniform discrete setup. We establish d ..."
Abstract

Cited by 1 (1 self)
 Add to MetaCart
We study the Hard Core Model on the graphs G obtained from Archimedean tilings i.e. configurations in {0,1} G with the nearest neighbor 1’s forbidden. Our particular aim in choosing these graphs is to obtain insight to the geometry of the densest packings in a uniform discrete setup. We establish
BlockCyclic Dense Linear Algebra
 SIAM JOURNAL ON SCIENTIFIC AND STATISTICAL COMPUTING
, 1992
"... Blockcyclic order elimination algorithms for LU and QR factorization and solve routines are described for distributed memory architectures with processing nodes configured as twodimensional arrays of arbitrary shape. The cyclic order elimination together with a consecutive data allocation yields g ..."
Abstract

Cited by 28 (0 self)
 Add to MetaCart
Blockcyclic order elimination algorithms for LU and QR factorization and solve routines are described for distributed memory architectures with processing nodes configured as twodimensional arrays of arbitrary shape. The cyclic order elimination together with a consecutive data allocation yields
Pebbling in Dense Graphs
, 2008
"... A configuration of pebbles on the vertices of a graph is solvable if one can place a pebble on any given root vertex via a sequence of pebbling steps. The pebbling number of a graph G is the minimum number π(G) so that every configuration of π(G) pebbles is solvable. A graph is Class 0 if its pebbli ..."
Abstract

Cited by 4 (3 self)
 Add to MetaCart
A configuration of pebbles on the vertices of a graph is solvable if one can place a pebble on any given root vertex via a sequence of pebbling steps. The pebbling number of a graph G is the minimum number π(G) so that every configuration of π(G) pebbles is solvable. A graph is Class 0 if its
On The Performance and Use of Dense Servers
, 2003
"... ... this paper, we describe a research prototype designated as the Super Dense Server (SDS), which was optimized for highdensity deployment. We describe its hardware features, show how they challenge the operating system and middleware, and describe how we have enhanced its software to handle these ..."
Abstract

Cited by 11 (3 self)
 Add to MetaCart
... this paper, we describe a research prototype designated as the Super Dense Server (SDS), which was optimized for highdensity deployment. We describe its hardware features, show how they challenge the operating system and middleware, and describe how we have enhanced its software to handle
Unified Approach to Dense Matter
, 2004
"... We apply the Skyrme model to dense hadronic matter, which provides a unified approach to high density, valid in the large Nc limit. In our picture, dense hadronic matter is described by the classical soliton configuration with minimum energy for the given baryon number density. By incorporating the ..."
Abstract
 Add to MetaCart
We apply the Skyrme model to dense hadronic matter, which provides a unified approach to high density, valid in the large Nc limit. In our picture, dense hadronic matter is described by the classical soliton configuration with minimum energy for the given baryon number density. By incorporating
Dense Linear Algebra Solvers for Multicore with GPU Accelerators
"... Abstract—Solving dense linear systems of equations is a fundamental problem in scientific computing. Numerical simulations involving complex systems represented in terms of unknown variables and relations between them often lead to linear systems of equations that must be solved as fast as possible. ..."
Abstract

Cited by 38 (14 self)
 Add to MetaCart
Abstract—Solving dense linear systems of equations is a fundamental problem in scientific computing. Numerical simulations involving complex systems represented in terms of unknown variables and relations between them often lead to linear systems of equations that must be solved as fast as possible
How toConstruct Dense Objects with SelfReconfigurable Robots
"... Summary. Selfreconfigurable robots can change their shape byrearranging the modules from which they are built. This selfreconfiguration process has proven difficult to control, because it involves control of adistributed system of autonomous, but mechanically coupled modules connected in timevary ..."
Abstract
 Add to MetaCart
varying ways. In this work we address this control problem and specifically look athow to construct dense configurations. The basic idea behind our solution is that holes inside the desired configuration and modules outside attract each other. The effect is that holes propagate tothe surface ofthe desired
Densechoice Counter Machines revisited
, 911
"... This paper clarifies the picture about Densechoice Counter Machines, which have been less studied than (discrete) Counter Machines. We revisit the definition of ”Dense Counter Machines ” so that it now extends (discrete) Counter Machines, and we provide new undecidability and decidability results. ..."
Abstract
 Add to MetaCart
. Using the firstorder additive mixed theory of reals and integers, we give a logical characterization of the sets of configurations reachable by reversalbounded Densechoice Counter Machines. 1
Results 1  10
of
798