• Documents
  • Authors
  • Tables
  • Log in
  • Sign up
  • MetaCart
  • DMCA
  • Donate

CiteSeerX logo

Tools

Sorted by:
Try your query at:
Semantic Scholar Scholar Academic
Google Bing DBLP
Results 1 - 10 of 8,753
Next 10 →

Adaptation of hierarchical task network plans

by Ian Warfield, Chad Hogg, Stephen Lee-urban, Héctor Muñoz-avila - In Proceedings of the Twentieth International FLAIRS Conference (FLAIRS-07 , 2007
"... This paper presents RepairSHOP a system capable of performing plan adaptation and plan repair. RepairSHOP is built on top of the HTN planner SHOP. RepairSHOP has three properties. The first property is its design modularity, which makes it is straightforward to apply the same process discussed in th ..."
Abstract - Cited by 4 (2 self) - Add to MetaCart
This paper presents RepairSHOP a system capable of performing plan adaptation and plan repair. RepairSHOP is built on top of the HTN planner SHOP. RepairSHOP has three properties. The first property is its design modularity, which makes it is straightforward to apply the same process discussed

Cognitive networks

by Ryan W. Thomas, Luiz A. DaSilva, Allen B. MacKenzie - IN PROC. OF IEEE DYSPAN 2005 , 2005
"... This paper presents a definition and framework for a novel type of adaptive data network: the cognitive network. In a cognitive network, the collection of elements that make up the network observes network conditions and then, using prior knowledge gained from previous interactions with the network ..."
Abstract - Cited by 1106 (7 self) - Add to MetaCart
This paper presents a definition and framework for a novel type of adaptive data network: the cognitive network. In a cognitive network, the collection of elements that make up the network observes network conditions and then, using prior knowledge gained from previous interactions

Coverage Control for Mobile Sensing Networks

by Jorge Cortes, Sonia Martínez, Timur Karatas, Francesco Bullo , 2002
"... This paper presents control and coordination algorithms for groups of vehicles. The focus is on autonomous vehicle networks performing distributed sensing tasks where each vehicle plays the role of a mobile tunable sensor. The paper proposes gradient descent algorithms for a class of utility functio ..."
Abstract - Cited by 582 (49 self) - Add to MetaCart
This paper presents control and coordination algorithms for groups of vehicles. The focus is on autonomous vehicle networks performing distributed sensing tasks where each vehicle plays the role of a mobile tunable sensor. The paper proposes gradient descent algorithms for a class of utility

Parallel Networks that Learn to Pronounce English Text

by Terrence J. Sejnowski, Charles R. Rosenberg - COMPLEX SYSTEMS , 1987
"... This paper describes NETtalk, a class of massively-parallel network systems that learn to convert English text to speech. The memory representations for pronunciations are learned by practice and are shared among many processing units. The performance of NETtalk has some similarities with observed h ..."
Abstract - Cited by 549 (5 self) - Add to MetaCart
task, but differ completely at the levels of synaptic strengths and single-unit responses. However, hierarchical clustering techniques applied to NETtalk reveal that these different networks have similar internal representations of letter-to-sound correspondences within groups of processing units

ASCENT: Adaptive self-configuring sensor networks topologies

by Alberto Cerpa, Deborah Estrin , 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 per-node 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
are necessary to establish a routing forwarding backbone. In ASCENT, each node assesses its connectivity and adapts its participation in the multihop network topology based on the measured operating region. This paper motivates and describes the ASCENT algorithm and presents analysis, simulation

Motivation through the Design of Work: Test of a Theory. Organizational Behavior and Human Performance,

by ] Richard Hackman , Grec R Oldham , 1976
"... A model is proposed that specifies the conditions under which individuals will become internally motivated to perform effectively on their jobs. The model focuses on the interaction among three classes of variables: (a) the psychological states of employees that must be present for internally motiv ..."
Abstract - Cited by 622 (2 self) - Add to MetaCart
and analysis; and to Gerrit Wolf for help in analytic planning. This report was prepared in connection with research supported by the Office of Naval Research (Organizational Effectiveness Research Program,, and by the Manpower Administration, U. S. Department of Labor . Since grantees conducting research

Distributed representations, simple recurrent networks, and grammatical structure

by Jeffrey L. Elman - Machine Learning , 1991
"... Abstract. In this paper three problems for a connectionist account of language are considered: 1. What is the nature of linguistic representations? 2. How can complex structural relationships such as constituent structure be represented? 3. How can the apparently open-ended nature of language be acc ..."
Abstract - Cited by 401 (17 self) - Add to MetaCart
be accommodated by a fixed-resource system? Using a prediction task, a simple recurrent network (SRN) is trained on multiclausal sentences which contain multiply-embedded relative clauses. Principal component analysis of the hidden unit activation patterns reveals that the network solves the task by developing

HTN planning: Complexity and expressivity

by Kutluhan Erol, James Hendler, Dana S. Nau - In AAAI-94 , 1994
"... Most practical work on AI planning systems during the last fteen years has been based on hierarchical task network (HTN) decomposition, but until now, there has been very little analytical work on the properties of HTN planners. This paper describes how the complexity of HTN planning varies with var ..."
Abstract - Cited by 315 (19 self) - Add to MetaCart
Most practical work on AI planning systems during the last fteen years has been based on hierarchical task network (HTN) decomposition, but until now, there has been very little analytical work on the properties of HTN planners. This paper describes how the complexity of HTN planning varies

The Fast Downward planning system

by Malte Helmert - Journal of Artifical Intelligence Research , 2006
"... Fast Downward is a classical planning system based on heuristic search. It can deal with general deterministic planning problems encoded in the propositional fragment of PDDL2.2, including advanced features like ADL conditions and effects and derived predicates (axioms). Like other well-known planne ..."
Abstract - Cited by 347 (29 self) - Add to MetaCart
is first translated into an alternative representation called multivalued planning tasks, which makes many of the implicit constraints of a propositional planning task explicit. Exploiting this alternative representation, Fast Downward uses hierarchical decompositions of planning tasks for computing its

Distributed Clustering for Ad Hoc Networks

by Stefano Basagni , 1999
"... A Distributed Clustering Algorithm (DCA) and a Distributed Mobility-Adaptive Clustering (DMAC) algorithm are presented that partition the nodes of a fully mobile network (ad hoc network) into clusters, thus giving the network a hierarchical organization. ..."
Abstract - Cited by 331 (6 self) - Add to MetaCart
A Distributed Clustering Algorithm (DCA) and a Distributed Mobility-Adaptive Clustering (DMAC) algorithm are presented that partition the nodes of a fully mobile network (ad hoc network) into clusters, thus giving the network a hierarchical organization.
Next 10 →
Results 1 - 10 of 8,753
Powered by: Apache Solr
  • About CiteSeerX
  • Submit and Index Documents
  • Privacy Policy
  • Help
  • Data
  • Source
  • Contact Us

Developed at and hosted by The College of Information Sciences and Technology

© 2007-2019 The Pennsylvania State University