516 search results - page 64 / 104 » Generalizing the Discrete Timed Automaton |
IMR
1999
Springer
14 years 2 months ago
1999
Springer
In computational simulation of coupled, multicomponent systems, it is frequently necessary to transfer data between meshes that may di er in resolution, structure, and discretizat...
GECCO
2006
Springer
14 years 1 months ago
2006
Springer
A genetic algorithm for the longest common subsequence problem encodes candidate sequences as binary strings that indicate subsequences of the shortest or first string. Its fitnes...
IPCO
2008
13 years 11 months ago
2008
We study the stochastic machine replenishment problem, which is a canonical special case of closed multiclass queuing systems in Markov decision theory. The problem models the sche...
AIPS
2006
13 years 11 months ago
2006
Markov decision processes (MDPs) with discrete and continuous state and action components can be solved efficiently by hybrid approximate linear programming (HALP). The main idea ...
NIPS
2001
13 years 11 months ago
2001
We introduce the Concave-Convex procedure (CCCP) which constructs discrete time iterative dynamical systems which are guaranteed to monotonically decrease global optimization/ener...