Sciweavers

1355 search results - page 21 / 271
» Alternating Timed Automata over Bounded Time
Sort
View
CIE
2007
Springer
14 years 1 months ago
From Logic to Physics: How the Meaning of Computation Changed over Time
The intuition guiding the de…nition of computation has shifted over time, a process that is re‡ected in the changing formulations of the Church-Turing thesis. The theory of co...
Itamar Pitowsky
CSL
2006
Springer
13 years 7 months ago
Automata and Logics for Words and Trees over an Infinite Alphabet
In a data word or a data tree each position carries a label from a finite alphabet and a data value from some infinite domain. These models have been considered in the realm of sem...
Luc Segoufin
DAWAK
2008
Springer
13 years 9 months ago
Efficient Approximate Mining of Frequent Patterns over Transactional Data Streams
Abstract. We investigate the problem of finding frequent patterns in a continuous stream of transactions. It is recognized that the approximate solutions are usually sufficient and...
Willie Ng, Manoranjan Dash
IJRR
2002
80views more  IJRR 2002»
13 years 7 months ago
Time Optimal Trajectories for Bounded Velocity Differential Drive Vehicles
This paper presents the time optimal trajectories for differential drive vehicles in the unobstructed plane. The wheel angular velocities are bounded, but may be discontinuous. Th...
Devin J. Balkcom, Matthew T. Mason
CHI
2007
ACM
14 years 8 months ago
SIG: capturing longitudinal usability: what really affects user performance over time?
In this Special Interest Group (SIG) the attendees will discuss methods for capturing usability data over time. Specifically, we will share industry best practices, brainstorm alt...
Misha W. Vaughan, Catherine Courage