Sciweavers

127 search results - page 15 / 26
» Composing Complete and Partial Knowledge
Sort
View
ASE
1998
81views more  ASE 1998»
13 years 7 months ago
Program Understanding as Constraint Satisfaction: Representation and Reasoning Techniques
The process of understanding a source code in a high-level programming language involves complex computation. Given a piece of legacy code and a library of program plan templates, ...
Steven G. Woods, Qiang Yang
ANLP
1994
155views more  ANLP 1994»
13 years 9 months ago
Guided Sentences Composition for Disabled People
We present the advantages of guided sentences composition for communicating in natural language with computers. We show how guidance can be achieved by means of the partial synthe...
Robert Pasero, Nathalie Richardet, Paul Sabatier
ICC
2007
IEEE
14 years 2 months ago
Optimal Precoder for Rate 1 Space-Time Block Codes
Abstract— Despite primary space-time coding where the channel state information (CSI) is available at the receiver only, the capacity and performance of multiple-input multiple-o...
Alireza Ghaderipoor, Chintha Tellambura
CISIS
2007
IEEE
13 years 9 months ago
Task Decomposition and Delegation Algorithms for Coordinating Unstructured Multi Agent Systems
This paper describes the initial PhD research work for developing an innovative process for agent coordination in unstructured distributed environments. In this proposal, an agent...
António Luis Lopes, Luís Miguel Bote...
JCM
2010
126views more  JCM 2010»
13 years 6 months ago
Adding Redundancy to Replication in Window-aware Delay-tolerant Routing
— This paper presents a resource-efficient protocol for opportunistic routing in delay-tolerant networks (DTN). First, our approach exploits the context of mobile nodes (speed, ...
Gabriel Sandulescu, Simin Nadjm-Tehrani