Tools
Sorted by:
Try your query at:
 |
 |
 |
 |
 |
 |
Results 11 - 20
of
2,244
A Meta-Model for the Analysis and Design of Organizations in Multi-Agent Systems
, 1998
"... This paper presents a generic meta-model of multi-agent systems based on organizational concepts such as groups, roles and structures. This model, called AALAADIN, defines a very simple description of coordination and negotiation schemes through multi-agent systems. Aalaadin is a meta-model of artif ..."
Abstract
-
Cited by 227 (11 self)
- Add to MetaCart
This paper presents a generic meta-model of multi-agent systems based on organizational concepts such as groups, roles and structures. This model, called AALAADIN, defines a very simple description of coordination and negotiation schemes through multi-agent systems. Aalaadin is a meta
Virtual Landmarks for the Internet
, 2003
"... Internet coordinate schemes have been proposed as a method for estimating minimum round trip time between hosts without direct measurement. In such a scheme, each host is assigned a set of coordinates, and Euclidean distance is used to form the desired estimate. Two key questions are: How accurate a ..."
Abstract
-
Cited by 187 (3 self)
- Add to MetaCart
Internet coordinate schemes have been proposed as a method for estimating minimum round trip time between hosts without direct measurement. In such a scheme, each host is assigned a set of coordinates, and Euclidean distance is used to form the desired estimate. Two key questions are: How accurate
SLA-based coordinated superscheduling scheme for computational Grids
- Proc. 8th IEEE International Conf. Cluster Computing (Cluster 2006
"... The Service Level Agreement (SLA) based grid superscheduling approach promotes coordinated resource sharing. Superscheduling is facilitated between administratively and topologically distributed grid sites by grid schedulers such as Resource brokers. In this work, we present a market-based SLA coord ..."
Abstract
-
Cited by 14 (8 self)
- Add to MetaCart
The Service Level Agreement (SLA) based grid superscheduling approach promotes coordinated resource sharing. Superscheduling is facilitated between administratively and topologically distributed grid sites by grid schedulers such as Resource brokers. In this work, we present a market-based SLA
Online palmprint identification
- IEEE Trans. Pattern Anal. Mach. Intell
, 2003
"... Abstract—Biometrics-based personal identification is regarded as an effective method for automatically recognizing, with a high confidence, a person’s identity. This paper presents a new biometric approach to online personal identification using palmprint technology. In contrast to the existing meth ..."
Abstract
-
Cited by 187 (39 self)
- Add to MetaCart
coordinate system is defined to facilitate image alignment for feature extraction. In addition, a 2D Gabor phase encoding scheme is proposed for palmprint feature extraction and representation. The experimental results demonstrate the feasibility of the proposed system. Index Terms—Biometrics, online
Hot topic: physical-layer network coding
- in Proc. of ACM Mobicom
, 2006
"... A main distinguishing feature of a wireless network compared with a wired network is its broadcast nature, in which the signal transmitted by a node may reach several other nodes, and a node may receive signals from several other nodes simultaneously. Rather than a blessing, this feature is treated ..."
Abstract
-
Cited by 190 (18 self)
- Add to MetaCart
. Specifically, we propose a physicallayer network coding (PNC) scheme to coordinate transmissions among nodes. In contrast to “straightforward ” network coding which performs coding arithmetic on digital bit streams after they have been received, PNC makes use of the additive nature of simultaneously arriving
Automatically parcellating the human cerebral cortex.
- Cereb. Cortex
, 2004
"... Abstract -We present a technique for automatically assigning a neuroanatomical label to each location on a cortical surface model based on probabilistic information estimated from Introduction Techniques for labeling geometric features of the cerebral cortex are useful for analyzing a variety of fu ..."
Abstract
-
Cited by 189 (14 self)
- Add to MetaCart
many techniques exist for labeling parts of the cortex The inclusion of prior information is a critical feature of a cortical parcellation algorithm. The reason this is the case is that the divisions that are useful in a cortical parcellation scheme can be based on properties of the brain other than
Multiagent Planning with Factored MDPs
- In NIPS-14
, 2001
"... We present a principled and efficient planning algorithm for cooperative multiagent dynamic systems. A striking feature of our method is that the coordination and communication between the agents is not imposed, but derived directly from the system dynamics and function approximation architecture ..."
Abstract
-
Cited by 176 (15 self)
- Add to MetaCart
is based on the use of factored linear value functions as an approximation to the joint value function. This factorization of the value function allows the agents to coordinate their actions at runtime using a natural message passing scheme. We provide a simple and efficient method for computing
A Quicker Way to Discover Nearby Peers
"... The match between a peer-to-peer overlay and the physical Internet infrastructure is a constant issue. Time-constrained peer-to-peer applications such as live streaming systems are even more challenging because participating peers have to discover their closest neighbors as quickly as possible. We p ..."
Abstract
-
Cited by 3 (2 self)
- Add to MetaCart
infrastructure: a peer should preferentially be connected with the peers that are the closest in Internet [10]. However determining its closest neighbors in a wide population spread on a large-scale network as Internet is still a challenge. Among the most promising ideas, coordinate-based schemes aim to fix
Diffusion maps and coarse-graining: A unified framework for dimensionality reduction, graph partitioning and data set parameterization
- IEEE Transactions on Pattern Analysis and Machine Intelligence
, 2006
"... We provide evidence that non-linear dimensionality reduction, clustering and data set parameterization can be solved within one and the same framework. The main idea is to define a system of coordinates with an explicit metric that reflects the connectivity of a given data set and that is robust to ..."
Abstract
-
Cited by 158 (5 self)
- Add to MetaCart
to noise. Our construction, which is based on a Markov random walk on the data, offers a general scheme of simultaneously reorganizing and subsampling graphs and arbitrarily shaped data sets in high dimensions using intrinsic geometry. We show that clustering in embedding spaces is equivalent
Formulating Dynamic Multi-rigid-body Contact Problems with Friction as Solvable Linear Complementarity Problems
- NONLINEAR DYNAMICS
, 1997
"... A linear complementarity formulation for dynamic multi-rigid-body contact problems with Coulomb friction is presented. The formulation, based on explicit Euler integration and polygonal approximation of the friction cone, is guaranteed to have a solution for any number of contacts and contact config ..."
Abstract
-
Cited by 138 (22 self)
- Add to MetaCart
configuration. A model with the same property is formulated for impact problems with friction and nonzero elasticity coefficient. An explicit Euler scheme based on these formulations is presented and is proved to have uniformly bounded velocities as the stepsize tends to zero for the Newton-Euler formulation
Results 11 - 20
of
2,244
