1884 search results - page 330 / 377 » Simple Algorithm for Simple Timed Games |
SSD
2001
Springer
15 years 2 months ago
2001
Springer
Recently there is much interest in moving objects databases, and data models and query languages have been proposed offering data types such as moving point and moving region toge...
109
click to vote
ANSS
1996
IEEE
15 years 2 months ago
1996
IEEE
The asymptotic bias and variance are important determinants of the quality of a simulation run. In particular, the asymptotic bias can be used to approximate the bias introduced b...
ERSHOV
1989
Springer
15 years 2 months ago
1989
Springer
This paper reports two experiments with implementations of constructions from theoretical computer science. The first one deals with Kleene’s and Rogers’ second recursion the...
100
click to vote
ICDCS
2010
IEEE
15 years 1 months ago
2010
IEEE
—We propose a steepest descent method to compute optimal control parameters for balancing between multiple performance objectives in stateless stochastic scheduling, wherein the ...
101
click to vote
TCS
2010
14 years 8 months ago
2010
: We study a variant of the path cover problem, namely, the k-fixed-endpoint path cover problem, or kPC for short. Given a graph G and a subset T of k vertices of V (G), a k-fixe...