Sciweavers

1295 search results - page 12 / 259
» Palimpsests of Time and Place
Sort
View
IJCGA
2010
99views more  IJCGA 2010»
14 years 8 months ago
Finding All Door Locations that Make a Room Searchable
—A room is a simple polygon with a prespecified point, called the door, on its boundary. Search may be conducted by two guards on the boundary who keep mutual visibility at all ...
Tsunehiko Kameda, John Z. Zhang
95
Voted
CORR
2011
Springer
191views Education» more  CORR 2011»
14 years 1 months ago
Computing Optimal Coverability Costs in Priced Timed Petri Nets
—We consider timed Petri nets, i.e., unbounded Petri nets where each token carries a real-valued clock. Transition arcs are labeled with time intervals, which specify constraints...
Parosh Aziz Abdulla, Richard Mayr
OOPSLA
2010
Springer
14 years 7 months ago
Programming with time: cyber-physical programming with impromptu
The act of computer programming is generally considered to be temporally removed from a computer program’s execution. In this paper we discuss the idea of programming as an acti...
Andrew Sorensen, Henry Gardner
INFORMATICALT
2000
159views more  INFORMATICALT 2000»
14 years 9 months ago
The Calculation of Electrotonic Potential Half-Time and its Derivative in Respect to Distance in One- and Two-Dimensional RC Med
In this work the analytical expressions of half-time T1/2 and its derivatives in respect to distance T1/2/R in a one-dimensional RC medium (a current electrode has a shape of the s...
Romualdas Veteikis
VTC
2010
IEEE
150views Communications» more  VTC 2010»
14 years 7 months ago
Optimizing Training-Based MIMO Systems: How Much Time is Needed for Actual Transmission?
—We study the design of training-based multiple-input multiple-output systems in two block-wise transmission schemes. The conventional transmission scheme has a fixed amount of ...
Xiangyun Zhou, Parastoo Sadeghi, Tharaka A. Lamahe...