Sciweavers

3754 search results - page 184 / 751
» Process modeling paradigms: an evaluation
Sort
View
168
Voted
CP
2005
Springer
15 years 11 months ago
AND/OR Branch-and-Bound for Solving Mixed Integer Linear Programming Problems
Abstract. AND/OR search spaces have recently been introduced as a unifying paradigm for advanced algorithmic schemes for graphical models. The main virtue of this representation is...
Radu Marinescu 0002, Rina Dechter
MA
1999
Springer
89views Communications» more  MA 1999»
15 years 10 months ago
Mobile Agent Platforms for Web Databases: A Qualitative and Quantitative Assessment
In this paper we present practical experiences gathered from the employment of two popular Java-based mobile-agent platforms, IBM's Aglets and Mitsubishi's Concordia. We...
George Samaras, Marios D. Dikaiakos, Constantinos ...
QEST
2008
IEEE
16 years 14 days ago
Symbolic Magnifying Lens Abstraction in Markov Decision Processes
Magnifying Lens Abstraction in Markov Decision Processes ∗ Pritam Roy1 David Parker2 Gethin Norman2 Luca de Alfaro1 Computer Engineering Dept, UC Santa Cruz, Santa Cruz, CA, USA ...
Pritam Roy, David Parker, Gethin Norman, Luca de A...
FUZZIEEE
2007
IEEE
16 years 13 days ago
Fuzzy Approximation for Convergent Model-Based Reinforcement Learning
— Reinforcement learning (RL) is a learning control paradigm that provides well-understood algorithms with good convergence and consistency properties. Unfortunately, these algor...
Lucian Busoniu, Damien Ernst, Bart De Schutter, Ro...
CP
1998
Springer
15 years 10 months ago
Modelling CSP Solution Algorithms with Petri Decision Nets
The constraint paradigm provides powerful concepts to represent and solve different kinds of planning problems, e. g. factory scheduling. Factory scheduling is a demanding optimiz...
Stephan Pontow