5055 search results - page 140 / 1011 » Relative Timing |
144
click to vote
IAT
2009
IEEE
15 years 11 months ago
2009
IEEE
—Commitments based on branching time logic are powerful representations for modeling multi-agent interactions. Current approaches into commitments have conceived these representa...
123
Voted
EUROCRYPT
2004
Springer
15 years 10 months ago
2004
Springer
Abstract. We present a technique for Merkle tree traversal which requires only logarithmic space and time1 . For a tree with N nodes, our algorithm computes sequential tree leaves ...
179
click to vote
ECRTS
2002
IEEE
15 years 10 months ago
2002
IEEE
Most WCET analysis techniques only provide an upper bound on the worst case execution time as a constant value. However, it often appears that the execution time of a piece of cod...
168
Voted
AIPS
2007
15 years 7 months ago
2007
The Manpower Allocation Problem with Time Windows, Job-Teaming Constraints and a limited number of teams (mMAPTWTC) is a crew scheduling problem faced in several different context...
139
click to vote
AAAI
2010
15 years 6 months ago
2010
For many election systems, bribery (and related) attacks have been shown NP-hard using constructions on combinatorially rich structures such as partitions and covers. It is import...