972 search results - page 125 / 195 » Reasoning with Conditional Time-Intervals |
115
click to vote
SIGMOD
2004
ACM
16 years 3 months ago
2004
ACM
Massive-scale self-administered networks like Peer-to-Peer and Sensor Networks have data distributed across thousands of participant hosts. These networks are highly dynamic with ...
100
click to vote
PLDI
2010
ACM
16 years 11 days ago
2010
ACM
Synthesis of program fragments from specifications can make programs easier to write and easier to reason about. To integrate synthesis into programming languages, synthesis algor...
105
click to vote
POPL
2010
ACM
16 years 11 days ago
2010
ACM
Serializability is a commonly used correctness condition in concurrent programming. When a concurrent module is serializable, certain other properties of the module can be verifie...
109
click to vote
ICS
2010
Tsinghua U.
16 years 11 days ago
2010
Tsinghua U.
: We develop a general game-theoretic framework for reasoning about strategic agents performing possibly costly computation. In this framework, many traditional game-theoretic resu...
115
click to vote
ICCAD
2003
IEEE
15 years 12 months ago
2003
IEEE
In this paper, we study the problem of retiming of sequential circuits with both interconnect and gate delay. Most retiming algorithms have assumed ideal conditions for the non-lo...