Sciweavers

1581 search results - page 204 / 317
» Domain semantics of possibility computations
Sort
View
94
Voted
KR
1989
Springer
15 years 4 months ago
Situated Control Rules
In this work we extend the work of Dean, Kaelbling, Kirman and Nicholson on planning under time constraints in stochastic domains to handle more complicated scheduling problems. I...
Mark Drummond
ACMICEC
2007
ACM
102views ECommerce» more  ACMICEC 2007»
15 years 4 months ago
Learning to trade with insider information
This paper introduces algorithms for learning how to trade using insider (superior) information in Kyle's model of financial markets. Prior results in finance theory relied o...
Sanmay Das
AAAI
2008
15 years 3 months ago
Grounding with Bounds
Grounding is the task of reducing a first-order theory to an equivalent propositional one. Typical grounders work on a sentence-by-sentence level, substituting variables by domain...
Johan Wittocx, Maarten Mariën, Marc Denecker
AISB
2008
Springer
15 years 2 months ago
Substitution for Fraenkel-Mostowski foundations
Abstract. A fundamental and unanalysed logical concept is substitution. This seemingly innocuous operation -- substituting a variable for a term or valuating a variable to an eleme...
Murdoch Gabbay, Michael Gabbay
CSREAESA
2004
15 years 2 months ago
Analytical Analysis of Data and Decision Fusion in Sensor Networks
- MEMS technology has improved such that the capabilities of large sensor devices can now be encompassed in devices that are the size of a penny. These resource constraint devices ...
Zille Huma Kamal, Mohammad Ali Salahuddin, Ajay K....