Results 1  10
of
1,460
Compositional Model Checking
, 1999
"... We describe a method for reducing the complexity of temporal logic model checking in systems composed of many parallel processes. The goal is to check properties of the components of a system and then deduce global properties from these local properties. The main difficulty with this type of approac ..."
Abstract

Cited by 3252 (70 self)
 Add to MetaCart
of approach is that local properties are often not preserved at the global level. We present a general framework for using additional interface processes to model the environment for a component. These interface processes are typically much simpler than the full environment of the component. By composing a
Automatic Programming of Behaviorbased Robots using Reinforcement Learning
, 1991
"... This paper describes a general approach for automatically programming a behaviorbased robot. New behaviors are learned by trial and error using a performance feedback function as reinforcement. Two algorithms for behavior learning are described that combine Q learning, a well known scheme for propa ..."
Abstract

Cited by 368 (17 self)
 Add to MetaCart
for propagating reinforcement values temporally across actions, with statistical clustering and Hamming distance, two ways of propagating reinforcement values spatially across states. A real behaviorbased robot called OBELIX is described that learns several component behaviors in an example task involving
A ChannelBased Coordination Model for Component Composition
 Mathematical Structures in Computer Science
, 2002
"... In this paper, we present Pew, a paradigm for composition of software components based on the notion of mobile channels. Pew is a channelbased exogenous coordination model wherein complex coordinators, called connectors are compositionally built out of simpler ones. ..."
Abstract

Cited by 225 (54 self)
 Add to MetaCart
In this paper, we present Pew, a paradigm for composition of software components based on the notion of mobile channels. Pew is a channelbased exogenous coordination model wherein complex coordinators, called connectors are compositionally built out of simpler ones.
A tutorial on crosslayer optimization in wireless networks
 IEEE JOURNAL ON SELECTED AREAS IN COMMUNICATIONS
, 2006
"... This tutorial paper overviews recent developments in optimization based approaches for resource allocation problems in wireless systems. We begin by overviewing important results in the area of opportunistic (channelaware) scheduling for cellular (singlehop) networks, where easily implementable my ..."
Abstract

Cited by 248 (29 self)
 Add to MetaCart
that the optimal scheduling component at the MAC layer is very complex and thus needs simpler (potentially imperfect) distributed solutions. We demonstrate how to use imperfect scheduling in the crosslayer framework and describe recently developed distributed algorithms along these lines. We conclude by describing
Simpler Sequential and Parallel Biconnectivity Augmentation
"... Abstract. For a connected graph, a vertex separator is a set of vertices whose removal creates at least two components and a minimum vertex separator is a vertex separator of least cardinality. The vertex connectivity refers to the size of a minimum vertex separator. For a connected graph G with ver ..."
Abstract
 Add to MetaCart
Abstract. For a connected graph, a vertex separator is a set of vertices whose removal creates at least two components and a minimum vertex separator is a vertex separator of least cardinality. The vertex connectivity refers to the size of a minimum vertex separator. For a connected graph G
Powernap: Eliminating server idle power
 In International Conference on Architectural Support for Programming Languages and Operating Systems (ASPLOS
, 2009
"... Data center power consumption is growing to unprecedented levels: the EPA estimates U.S. data centers will consume 100 billion kilowatt hours annually by 2011. Much of this energy is wasted in idle systems: in typical deployments, server utilization is below 30%, but idle servers still consume 60 ..."
Abstract

Cited by 219 (4 self)
 Add to MetaCart
nearzeropower idle state in response to instantaneous load. Rather than requiring finegrained powerperformance states and complex loadproportional operation from each system component, PowerNap instead calls for minimizing idle power and transition time, which are simpler optimization goals
Hierarchical Mesh Decomposition Using Fuzzy Clustering and Cuts
, 2003
"... Cutting up a complex object into simpler subobjects is a fundamental problem in various disciplines. In image processing, images are segmented while in computational geometry, solid polyhedra are decomposed. In recent years, in computer graphics, polygonal meshes are decomposed into submeshes. In ..."
Abstract

Cited by 191 (6 self)
 Add to MetaCart
Cutting up a complex object into simpler subobjects is a fundamental problem in various disciplines. In image processing, images are segmented while in computational geometry, solid polyhedra are decomposed. In recent years, in computer graphics, polygonal meshes are decomposed into sub
Bayesian phylogenetic analysis of combined data
 Syst. Biol
, 2004
"... Abstract. — The recent development of Bayesian phylogenetic inference using Markov chain Monte Carlo (MCMC) techniques has facilitated the exploration of parameterrich evolutionary models. At the same time, stochastic models have become more realistic (and complex) and have been extended to new typ ..."
Abstract

Cited by 203 (12 self)
 Add to MetaCart
, supporting the utility of morphological data in multigene analyses. We used Bayesian criteria (Bayes factors) to show that process heterogeneity across data partitions is a significant model component, although not as important as amongsite rate variation. More complex evolutionary models are associated
Hierarchical Wrapper Induction for Semistructured Information Sources
 Journal of Autonomous Agents and MultiAgent Systems
, 2001
"... With the tremendous amount of information that becomes available on the Web on a daily basis, the ability to quickly develop information agents has become a crucial problem. A vital component of any Webbased information agent is a set of wrappers that can extract the relevant data from semistructur ..."
Abstract

Cited by 185 (34 self)
 Add to MetaCart
With the tremendous amount of information that becomes available on the Web on a daily basis, the ability to quickly develop information agents has become a crucial problem. A vital component of any Webbased information agent is a set of wrappers that can extract the relevant data from
Maximum Likelihood and Covariant Algorithms for Independent Component Analysis
, 1996
"... Bell and Sejnowski (1995) have derived a blind signal processing algorithm for a nonlinear feedforward network from an information maximization viewpoint. This paper first shows that the same algorithm can be viewed as a maximum likelihood algorithm for the optimization of a linear generative model ..."
Abstract

Cited by 117 (1 self)
 Add to MetaCart
model. Second, a covariant version of the algorithm is derived. This algorithm is simpler and somewhat more biologically plausible, involving no matrix inversions; and it converges in a smaller number of iterations. Third, this paper gives a partial proof of the `folktheorem' that any mixture
Results 1  10
of
1,460