2273 search results - page 151 / 455 » On the Expressiveness and Complexity of ATL |
LPNMR
2005
Springer
15 years 3 months ago
2005
Springer
Two approaches to logic programming with probabilities emerged over time: bayesian reasoning and probabilistic satisfiability (PSAT). The attractiveness of the former is in tying ...
CAISE
2004
Springer
15 years 3 months ago
2004
Springer
tween documents. They should allow for an abstract representation of data which resembles the way they are actually perceived and used in the real world, thus shortening (with resp...
89
Voted
ITC
2003
IEEE
15 years 3 months ago
2003
IEEE
Functional verification of complex designs largely relies on the use of simulation in conjunction high-level verification languages (HVL) and test-bench automation (TBA) tools. In...
CCGRID
2002
IEEE
15 years 3 months ago
2002
IEEE
A scalable and expressive peer-to-peer (P2P) networking and computing framework requires efficient resource discovery services. Here we propose NEVRLATE, for Network-Efficient V...
CP
1999
Springer
15 years 2 months ago
1999
Springer
Reformulating constraint satisfaction problems (CSPs) in lower arity is a common procedure when computing consistency. Lower arity CSPs are simpler to treat than high arity CSPs. ...