529 search results - page 102 / 106 » Simple Random Logic Programs |
ICALP
1998
Springer
14 years 2 months ago
1998
Springer
We show that characteristic formulae for nite-state systems up to bisimulationlike equivalences (e.g., strong and weak bisimilarity) can be given in the simple branching-time temp...
CPAIOR
2006
Springer
14 years 1 months ago
2006
Springer
Temporal planning (TP) is notoriously difficult because it requires to solve a propositional STRIPS planning problem with temporal constraints. In this paper, we propose an efficie...
AAMAS
2005
Springer
13 years 9 months ago
2005
Springer
One of the most difficult problems in Multi-Agent Systems (MAS) involves representing the knowledge and beliefs of an agent which performs its tasks in a dynamic environment. New p...
CASES
2010
ACM
13 years 7 months ago
2010
ACM
Although cryptographic algorithms are designed to resist at least thousands of years of cryptoanalysis, implementing them with either software or hardware usually leaks additional...
ICC
2007
IEEE
14 years 4 months ago
2007
IEEE
— We address a lifetime maximization problem for a single-hop wireless sensor network where multiple sensors encode and communicate their measurements of a Gaussian random source...