Sciweavers

670 search results - page 79 / 134
» Inclusion-Based Approximate Reasoning
Sort
View
AI
2010
Springer
13 years 8 months ago
Updating action domain descriptions
How can an intelligent agent update her knowledge base about an action domain, relative to some conditions (possibly obtained from earlier observations)? We study this question in...
Thomas Eiter, Esra Erdem, Michael Fink, Ján...
CORR
2010
Springer
143views Education» more  CORR 2010»
13 years 8 months ago
Opportunistic Routing in Ad Hoc Networks: How many relays should there be? What rate should nodes use?
Opportunistic routing is a multi-hop routing scheme which allows for selection of the best immediately available relay. In blind opportunistic routing protocols, where transmitters...
Joseph Blomer, Nihar Jindal
ENTCS
2006
118views more  ENTCS 2006»
13 years 7 months ago
An Operational Domain-theoretic Treatment of Recursive Types
We develop a domain theory for treating recursive types with respect to contextual equivalence. The principal approach taken here deviates from classical domain theory in that we ...
Weng Kin Ho
ENTCS
2006
113views more  ENTCS 2006»
13 years 7 months ago
A Large-Scale Experiment in Executing Extracted Programs
It is a well-known fact that algorithms are often hidden inside mathematical proofs. If these proofs are formalized inside a proof assistant, then a mechanism called extraction ca...
Luís Cruz-Filipe, Pierre Letouzey
IJCSA
2006
289views more  IJCSA 2006»
13 years 7 months ago
Cash Forecasting: An Application of Artificial Neural Networks in Finance
Artificial Neural Networks are universal and highly flexible function approximators first used in the fields of cognitive science and engineering. In recent years, Neural Networks...
PremChand Kumar, Ekta Walia