14382 search results - page 299 / 2877 » Time in Connectionist Models |
286
click to vote
POPL
2006
ACM
16 years 7 months ago
2006
ACM
Abstract. This paper investigates what is essentially a call-by-value version of PCF under a complexity-theoretically motivated type system. The programming formalism, ATR, has its...
169
click to vote
FOSSACS
2009
Springer
16 years 1 months ago
2009
Springer
Abstract. In this work, we introduce the class of Interrupt Timed Automata (ITA), which are well suited to the description of multi-task systems with interruptions in a single proc...
168
click to vote
IAT
2009
IEEE
16 years 1 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...
162
click to vote
MIR
2003
ACM
15 years 12 months ago
2003
ACM
This paper proposes a method to automatically extract highlight scenes from sports (baseball) live video in real time and to allow users to retrieve them. For this purpose, sophis...
188
click to vote
ANSS
2002
IEEE
15 years 11 months ago
2002
IEEE
This paper introduces TUTW – Temporal Uncertainty Time Warp – a control engine designed for an exploitation of temporal uncertainty (TU) in general optimistic simulations, and...