EVOW
2011
Springer
12 years 8 months ago
2011
Springer
Abstract. Electronic embedded systems designers aim at finding a tradeoff between cost and power consumption. As cache memory management has been shown to have a significant imp...
CORR
2011
Springer
12 years 8 months ago
2011
Springer
—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...
TCS
2010
12 years 11 months ago
2010
We study a resource allocation problem where jobs have the following characteristics: Each job consumes some quantity of a bounded resource during a certain time interval and indu...
VTC
2010
IEEE
13 years 2 months ago
2010
IEEE
—The IEEE 1609.4 standard has been proposed to provide multi-channel operations in wireless access for vehicular environments (WAVE), where all the channels are periodically sync...
TFS
2008
13 years 4 months ago
2008
When the time span of an event is imprecise, it can be represented by a fuzzy set, called a fuzzy time interval. In this paper, we propose a framework to represent, compute, and re...
JSS
2006
13 years 4 months ago
2006
This paper describes an approach to the feature location problem for distributed systems, that is, to the problem of locating which code components are important in providing a pa...
ICALP
2010
Springer
13 years 4 months ago
2010
Springer
Abstract. We propose a theory of time-bounded verification for realtime systems, in which verification queries are phrased over time intervals of fixed, bounded duration. We argue ...
ECAI
2010
Springer
13 years 5 months ago
2010
Springer
Abstract. Interval temporal logics formalize reasoning about interval structures over (usually) linearly ordered domains, where time intervals are the primitive ontological entitie...
AAAI
1990
13 years 5 months ago
1990
Ladkin and Maddux [LaMa87] showed how to interpret the calculus of time intervals defined by Allen [AZ2831 in terms of representations of a particular relation algebra, and proved...
COMPGEOM
2008
ACM
13 years 6 months ago
2008
ACM
We consider the problem of finding a maximum number of disjoint paths for unit disks moving amidst static or dynamic obstacles. For the static case we give efficient exact algorit...