Sciweavers

71 search results - page 12 / 15
» ETL Workflows: From Formal Specification to Optimization
Sort
View
CADE
2008
Springer
14 years 7 months ago
Certifying a Tree Automata Completion Checker
Tree automata completion is a technique for the verification of infinite state systems. It has already been used for the verification of cryptographic protocols and the prototyping...
Benoît Boyer, Thomas Genet, Thomas P. Jensen
TKDE
2012
487views Formal Methods» more  TKDE 2012»
11 years 9 months ago
Query Planning for Continuous Aggregation Queries over a Network of Data Aggregators
—Continuous queries are used to monitor changes to time varying data and to provide results useful for online decision making. Typically a user desires to obtain the value of som...
Rajeev Gupta, Krithi Ramamritham
GECCO
2006
Springer
159views Optimization» more  GECCO 2006»
13 years 11 months ago
Standard and averaging reinforcement learning in XCS
This paper investigates reinforcement learning (RL) in XCS. First, it formally shows that XCS implements a method of generalized RL based on linear approximators, in which the usu...
Pier Luca Lanzi, Daniele Loiacono
TVCG
2010
129views more  TVCG 2010»
13 years 5 months ago
Projector Placement Planning for High Quality Visualizations on Real-World Colored Objects
—Many visualization applications benefit from displaying content on real-world objects rather than on a traditional display (e.g., a monitor). This type of visualization display ...
Alvin J. Law, Daniel G. Aliaga, Aditi Majumder
SCOPES
2004
Springer
14 years 24 days ago
Compact Procedural Implementation in DSP Software Synthesis Through Recursive Graph Decomposition
Abstract. Synthesis of digital signal processing (DSP) software from dataflow-based formal models is an effective approach for tackling the complexity of modern DSP applications. I...
Ming-Yung Ko, Praveen K. Murthy, Shuvra S. Bhattac...