Sciweavers

333 search results - page 39 / 67
» On the complexity of partial order trace model checking
Sort
View
ICTAI
2005
IEEE
14 years 1 months ago
Reachability Analysis for Uncertain SSPs
Stochastic Shortest Path problems (SSPs) can be efficiently dealt with by the Real-Time Dynamic Programming algorithm (RTDP). Yet, RTDP requires that a goal state is always reach...
Olivier Buffet
CP
2007
Springer
14 years 1 months ago
Path Consistency by Dual Consistency
Dual Consistency (DC) is a property of Constraint Networks (CNs) which is equivalent, in its unrestricted form, to Path Consistency (PC). The principle is to perform successive sin...
Christophe Lecoutre, Stéphane Cardon, Julie...
KER
2008
134views more  KER 2008»
13 years 7 months ago
A review of current defeasible reasoning implementations
This article surveys existing practical implementations of both defeasible and argumentationbased reasoning engines and associated literature. We aim to summarise the current stat...
Daniel Bryant, Paul J. Krause
JSSPP
2009
Springer
14 years 2 months ago
Analyzing the EGEE Production Grid Workload: Application to Jobs Submission Optimization
Abstract. Grids reliability remains an order of magnitude below clusters on production infrastructures. This work is aimsed at improving grid application performances by improving ...
Diane Lingrand, Johan Montagnat, Janusz Martyniak,...
IPPS
2008
IEEE
14 years 2 months ago
Measuring power and temperature from real processors
The modeling of power and thermal behavior of modern processors requires challenging validation approaches, which may be complex and in some cases unreliable. In order to address ...
Francisco J. Mesa-Martinez, Michael Brown, Joseph ...