889 search results - page 67 / 178 » Problems in Rewriting III |
ISCC
2009
IEEE
14 years 4 months ago
2009
IEEE
A problem in large and dynamic networks consists in making available at each node global information about the state of the network. Gossip-based aggregation schemes are a simple ...
RTSS
2008
IEEE
14 years 4 months ago
2008
IEEE
The wide applications of cyber-physical systems (CPS) call for effective design strategies that optimize the performance of both computing units and physical plants. We study the ...
ASIACRYPT
2004
Springer
14 years 3 months ago
2004
Springer
We consider the problem of securely computing the Greater Than (GT) predicate and its generalization – securely determining membership in a union of intervals. We approach these ...
FORMATS
2004
Springer
14 years 3 months ago
2004
Springer
We study the model-checking problem for weighted timed automata and the weighted CTL logic by the bisimulation approach. Weighted timed automata are timed automata extended with co...
AAAI
2008
14 years 9 days ago
2008
We propose a new local search platform that splits a CNF formula into three sub-components: i) a minimal dependency lattice (representing the core connections between logic gates)...