4066 search results - page 457 / 814 » Almost Complete Sets |
159
click to vote
CSDA
2008
15 years 7 months ago
2008
Semi-continuous data arise in many applications where naturally-continuous data become contaminated by the data generating mechanism. The resulting data contain several values tha...
184
click to vote
ECRA
2008
15 years 7 months ago
2008
Mobile payments can be categorized according to their usage in each of the five payment scenarios presented here. The paper proposes the mobile payment modeling approach (MPMA) es...
179
click to vote
ENTCS
2008
15 years 7 months ago
2008
The satisfiability problems for CTL and CTL are known to be EXPTIME-complete, resp. 2EXPTIMEcomplete (Fischer and Ladner (1979), Vardi and Stockmeyer (1985)). For fragments that u...
150
click to vote
FMSD
2008
15 years 7 months ago
2008
Timed automata are governed by an idealized semantics that assumes a perfectly precise behavior of the clocks. The traditional semantics is not robust because the slightest perturb...
215
click to vote
FUIN
2008
15 years 7 months ago
2008
In this paper, we consider safe Time Petri Nets where time intervals (strict and large) are associated with places (P-TPN), arcs (A-TPN) or transitions (T-TPN). We give the formal ...