3218 search results - page 359 / 644 » Timed Extensions for SDL |
219
click to vote
SCP
2000
15 years 6 months ago
2000
Obtaining performance models, like Markov chains and queueing networks, for systems of significant complexity and magnitude is a difficult task that is usually tackled using human...
160
click to vote
CORR
2010
Springer
15 years 5 months ago
2010
Springer
We consider an extension of the popular matching problem in this paper. The input to the popular matching problem is a bipartite graph G = (A ∪ B, E), where A is a set of people,...
175
click to vote
PVLDB
2010
15 years 5 months ago
2010
Commercial databases compete for market share, which is composed of not only net-new sales to those purchasing a database for the first time, but also competitive “win-backs”...
273
click to vote
GIS
2005
ACM
16 years 7 months ago
2005
ACM
Databases of moving objects are important for air traffic control, ground traffic, and battlefield configurations. We introduce the (historical and spatial) range close-pair query...
136
click to vote
DCC
2008
IEEE
16 years 6 months ago
2008
IEEE
The Range Minimum Query (RMQ) Problem is to preprocess an array A of length n in O(n) time such that subsequent on-line queries asking for the position of a minimal element between...