Sciweavers

2052 search results - page 382 / 411
» Direct Combination
Sort
View
AAAI
1997
15 years 1 months ago
Model Minimization in Markov Decision Processes
Many stochastic planning problems can be represented using Markov Decision Processes (MDPs). A difficulty with using these MDP representations is that the common algorithms for so...
Thomas Dean, Robert Givan
BIS
2009
154views Business» more  BIS 2009»
15 years 27 days ago
Using Process Mining to Generate Accurate and Interactive Business Process Maps
Abstract. The quality of today's digital maps is very high. This allows for new functionality as illustrated by modern car navigation systems (e.g., TomTom, Garmin, etc.), Goo...
Wil M. P. van der Aalst
GECCO
2008
Springer
141views Optimization» more  GECCO 2008»
15 years 26 days ago
Managing team-based problem solving with symbiotic bid-based genetic programming
Bid-based Genetic Programming (GP) provides an elegant mechanism for facilitating cooperative problem decomposition without an a priori specification of the number of team member...
Peter Lichodzijewski, Malcolm I. Heywood
ISSTA
2010
ACM
14 years 12 months ago
Automatically identifying critical input regions and code in applications
Applications that process complex inputs often react in different ways to changes in different regions of the input. Small changes to forgiving regions induce correspondingly smal...
Michael Carbin, Martin C. Rinard
MM
2010
ACM
151views Multimedia» more  MM 2010»
14 years 12 months ago
Explicit and implicit concept-based video retrieval with bipartite graph propagation model
The major scientific problem for content-based video retrieval is the semantic gap. Generally speaking, there are two appropriate ways to bridge the semantic gap: the first one is...
Lei Bao, Juan Cao, Yongdong Zhang, Jintao Li, Ming...