1355 search results - page 220 / 271 » Alternating Timed Automata over Bounded Time |
133
click to vote
AE
2007
Springer
15 years 11 months ago
2007
Springer
Abstract. How has a stack of n blocks to be arranged in order to maximize its overhang over a table edge while being stable? This question can be seen as an example application for...
132
click to vote
ATAL
2007
Springer
15 years 11 months ago
2007
Springer
Recent results have established that a variety of voting rules are computationally hard to manipulate in the worst-case; this arguably provides some guarantee of resistance to man...
134
click to vote
EMSOFT
2007
Springer
15 years 11 months ago
2007
Springer
E-FRP is declarative language for programming resourcebounded, event-driven systems. The original high-level semantics of E-FRP requires that each event handler execute atomically...
148
click to vote
APPROX
2004
Springer
15 years 10 months ago
2004
Springer
A simple first moment argument shows that in a randomly chosen k-SAT formula with m clauses over n boolean variables, the fraction of satisfiable clauses is 1−2−k +o(1) as m/...
178
click to vote
ISCC
2003
IEEE
15 years 10 months ago
2003
IEEE
— We consider a network of n sender/receiver pairs, placed randomly in a region of unit area. Network capacity, or maximum throughput, is defined as the highest rate that can be...