1884 search results - page 175 / 377 » Simple Algorithm for Simple Timed Games |
120
Voted
SAS
2009
Springer
16 years 3 months ago
2009
Springer
Abstract. While the tightest proven worst-case complexity for Andersen's points-to analysis is nearly cubic, the analysis seems to scale better on real-world codes. We examine...
118
Voted
WEA
2007
Springer
15 years 8 months ago
2007
Springer
Dynamic tree data structures maintain forests that change over time through edge insertions and deletions. Besides maintaining connectivity information in logarithmic time, they ca...
137
Voted
ICPP
1993
IEEE
15 years 6 months ago
1993
IEEE
Task graphs are used for scheduling tasks on parallel processors when the tasks have dependencies. If the execution of the program is known ahead of time, then the tasks can be st...
108
Voted
COCO
2006
Springer
15 years 4 months ago
2006
Springer
We study the identity testing problem for depth 3 arithmetic circuits ( circuit). We give the first deterministic polynomial time identity test for circuits with bounded top fanin...
108
click to vote
NIPS
1993
15 years 4 months ago
1993
This paper describes the Q-routing algorithm for packet routing, in which a reinforcement learning module is embedded into each node of a switching network. Only local communicati...