8413 search results - page 406 / 1683 » Ordering Problem Subgoals |
158
click to vote
IPPS
2005
IEEE
16 years 8 days ago
2005
IEEE
— Schedule synthesis based on reachability analysis of timed automata has received attention in the last few years. The main strength of this approach is that the expressiveness ...
210
click to vote
SAC
2005
ACM
16 years 7 days ago
2005
ACM
This paper presents a novel model of reinforcement learning agents. A feature of our learning agent model is to integrate analytic hierarchy process (AHP) into a standard reinforc...
173
click to vote
WEA
2005
Springer
16 years 5 days ago
2005
Springer
Ordered Binary Decision Diagrams (OBDDs) are a data structure for Boolean functions which supports many useful operations. It finds applications in CAD, model checking, and symbol...
142
click to vote
NOSSDAV
2004
Springer
16 years 1 days ago
2004
Springer
In recent years, several architectures have been proposed and developed for supporting streaming applications that take advantage of multiple paths through the network simultaneou...
172
click to vote
ICCBR
2003
Springer
15 years 12 months ago
2003
Springer
Abstract. Very often a planning problem can be formulated as a ranking problem: i.e. to find an order relation over a set of alternatives. The ranking of a finite set of alternat...