1118 search results - page 82 / 224 » Hybrid possibilistic networks |
CONEXT
2007
ACM
14 years 1 months ago
2007
ACM
Deterministic finite automata (DFAs) are widely used to perform regular expression matching in linear time. Several techniques have been proposed to compress DFAs in order to redu...
HIS
2008
13 years 10 months ago
2008
Machine scheduling is a critical problem in industries where products are custom-designed. The wide range of products, the lack of previous experiences in manufacturing, and the s...
GLOBECOM
2010
IEEE
13 years 7 months ago
2010
IEEE
There has been a dramatic increase in interactive cloud based software applications. Compared to classical realtime media applications (voice over IP (VoIP)/conferencing) and non r...
JAIR
2007
13 years 9 months ago
2007
Numerous formalisms and dedicated algorithms have been designed in the last decades to model and solve decision making problems. Some formalisms, such as constraint networks, can ...
DSOM
2009
Springer
14 years 3 months ago
2009
Springer
Abstract. We propose a novel hybrid planning approach for the automated generation of IT change plans. The algorithm addresses an abstraction mismatch between refinement of tasks ...