Sciweavers

99 search results - page 14 / 20
» Temporal Decomposition for Logic Optimization
Sort
View
ECAI
2006
Springer
13 years 11 months ago
Least Squares SVM for Least Squares TD Learning
Abstract. We formulate the problem of least squares temporal difference learning (LSTD) in the framework of least squares SVM (LS-SVM). To cope with the large amount (and possible ...
Tobias Jung, Daniel Polani
FAST
2011
12 years 11 months ago
Leveraging Value Locality in Optimizing NAND Flash-based SSDs
: NAND flash-based solid-state drives (SSDs) are increasingly being deployed in storage systems at different levels such as buffer-caches and even secondary storage. However, the ...
Aayush Gupta, Raghav Pisolkar, Bhuvan Urgaonkar, A...
ATAL
2009
Springer
14 years 4 days ago
GDT4MAS: an extension of the GDT model to specify and to verify MultiAgent systems
The Goal Decomposition Tree model has been introduced in 2005 by Mermet et al. [9] to specify and verify the behaviour of an agent evolving in a dynamic environment. This model pr...
Bruno Mermet, Gaële Simon
FUZZY
1997
Springer
166views Fuzzy Logic» more  FUZZY 1997»
13 years 11 months ago
Optimizing Video Signal Processing Algorithms by Evolution Strategies
Today many kinds of postprocessing are used in digital TV receivers or multimedia terminals for video signals to enhance the picture quality. To achieve this the properties of hum...
H. Blume, O. Franzen, M. Schmidt
COCOS
2003
Springer
148views Optimization» more  COCOS 2003»
14 years 22 days ago
Convex Programming Methods for Global Optimization
We investigate some approaches to solving nonconvex global optimization problems by convex nonlinear programming methods. We assume that the problem becomes convex when selected va...
John N. Hooker