Sciweavers

10055 search results - page 26 / 2011
» Structured programming using processes
Sort
View
APN
2008
Springer
13 years 9 months ago
Process Discovery Using Integer Linear Programming
Abstract. The research domain of process discovery aims at constructocess model (e.g. a Petri net) which is an abstract representation of an execution log. Such a Petri net should ...
Jan Martijn E. M. van der Werf, Boudewijn F. van D...
ICML
2010
IEEE
13 years 8 months ago
Feature Selection Using Regularization in Approximate Linear Programs for Markov Decision Processes
Approximate dynamic programming has been used successfully in a large variety of domains, but it relies on a small set of provided approximation features to calculate solutions re...
Marek Petrik, Gavin Taylor, Ronald Parr, Shlomo Zi...
KDD
1998
ACM
140views Data Mining» more  KDD 1998»
13 years 12 months ago
Active Templates: Comprehensive Support for the Knowledge Discovery Process
The goal of Active Template research is to create a single, unified environment that a data analyst can use to carry out a knowledge discovery project, and to deliver the resultin...
Randy Kerber, Hal Beck, Tej Anand, Bill Smart
IJCAI
2007
13 years 9 months ago
Using Linear Programming for Bayesian Exploration in Markov Decision Processes
A key problem in reinforcement learning is finding a good balance between the need to explore the environment and the need to gain rewards by exploiting existing knowledge. Much ...
Pablo Samuel Castro, Doina Precup
IFL
2007
Springer
120views Formal Methods» more  IFL 2007»
14 years 1 months ago
Lazy Contract Checking for Immutable Data Structures
Existing contract checkers for data structures force programmers to choose between poor alternatives. Contracts are either built into the functions that construct the data structur...
Robert Bruce Findler, Shu-yu Guo, Anne Rogers