3229 search results - page 274 / 646 » The Theory of Timed Automata |
143
click to vote
ICALP
1999
Springer
15 years 11 months ago
1999
Springer
We demonstrate an ⍀( pn1ϩ1/p) lower bound on the average-case running time (uniform distribution) of p-pass Shellsort. This is the first nontrivial general lower bound for avera...
155
Voted
JDA
2008
15 years 6 months ago
2008
The best approximation algorithm for Max Cut in graphs of maximum degree 3 uses semidefinite programming, has approximation ratio 0.9326, and its running time is (n3.5 log n) ; bu...
145
click to vote
IJCAI
1993
15 years 8 months ago
1993
literal: Let p be a proposition. Then p and -p are literals. clause: A clause is a disjunction of literals. Horn Clause: A Horn Clause is a clause in which there is at most one po...
217
click to vote
TSMC
2008
15 years 6 months ago
2008
Future generations of air traffic management systems may give appropriately equipped aircraft the freedom to change flight paths in real time. This would require a conflict avoidan...
231
click to vote
CADE
2007
Springer
16 years 7 months ago
2007
Springer
Manna and Pnueli have extensively shown how a mixture of first-order logic (FOL) and discrete Linear time Temporal Logic (LTL) is sufficient to precisely state verification problem...