2583 search results - page 495 / 517 » On the Representation of Timed Polyhedra |
TRECVID
2007
15 years 9 days ago
2007
Etter Solutions Research Group participated in the TRECVID conference for the first time in 2007. We submitted five runs in the area of fully automatic search. Fully Automatic Sea...
100
Voted
ATAL
2010
Springer
15 years 7 days ago
2010
Springer
Planning how to interact against bounded memory and unbounded memory learning opponents needs different treatment. Thus far, however, work in this area has shown how to design pla...
111
click to vote
ATAL
2010
Springer
15 years 7 days ago
2010
Springer
We consider the computational complexity of pure Nash equilibria in graphical games. It is known that the problem is NP-complete in general, but tractable (i.e., in P) for special...
GECCO
2008
Springer
15 years 6 days ago
2008
Springer
In this paper we present a swarm grammar system that makes use of bio-inspired mechanisms of reproduction, communication and construction in order to build three-dimensional struc...
ICFP
2010
ACM
15 years 6 days ago
2010
ACM
Reasoning about program equivalence is one of the oldest problems in semantics. In recent years, useful techniques have been developed, based on bisimulations and logical relation...