Sciweavers

250 search results - page 50 / 50
» Reflections on Finite Model Theory
Sort
View
ATAL
2010
Springer
13 years 6 months ago
Planning against fictitious players in repeated normal form games
Planning how to interact against bounded memory and unbounded memory learning opponents needs different treatment. Thus far, however, work in this area has shown how to design pla...
Enrique Munoz de Cote, Nicholas R. Jennings
EOR
2008
311views more  EOR 2008»
13 years 5 months ago
Optimal pricing, EOL (end of life) warranty, and spare parts manufacturing strategy amid product transition
We study firm's strategy to determine its product price and warranty period, and plan the spare parts manufacturing so as to maximize its profit and at the same time to fulfi...
Bowon Kim, Sangsun Park
MOC
2002
118views more  MOC 2002»
13 years 5 months ago
The error bounds and tractability of quasi-Monte Carlo algorithms in infinite dimension
Dimensionally unbounded problems are frequently encountered in practice, such as in simulations of stochastic processes, in particle and light transport problems and in the problem...
Fred J. Hickernell, Xiaoqun Wang
JUCS
2010
152views more  JUCS 2010»
13 years 16 days ago
Compositional Semantics of Dataflow Networks with Query-Driven Communication of Exact Values
: We develop and study the concept of dataflow process networks as used for example by Kahn to suit exact computation over data types related to real numbers, such as continuous fu...
Michal Konecný, Amin Farjudian
DIMACS
1996
13 years 7 months ago
Easier Ways to Win Logical Games
in Structure'95. 14] R. Fagin. Easier ways to win logical games. In Proc. DIMACS Workshop on Descriptive Complexity and Finite Models, AMS 1997. 15] R. Fagin, L. Stockmeyer, M...
Ronald Fagin