4313 search results - page 101 / 863 » Using time travel to diagnose computer problems |
142
click to vote
EOR
2007
15 years 4 months ago
2007
This paper studies an arc routing problem with capacity constraints and time-dependent service costs. This problem is motivated by winter gritting applications where the ‘‘tim...
223
click to vote
ICICIC
2006
IEEE
15 years 10 months ago
2006
IEEE
In timetable scheduling problems, examination subjects must be slotted to certain times that satisfy several of constraints. They are NP-completeness problems, which usually lead ...
158
click to vote
FORMATS
2003
Springer
15 years 9 months ago
2003
Springer
Probabilistic timed automata, a variant of timed automata extended with discrete probability distributions, is a specification formalism suitable for describing both nondeterminis...
116
click to vote
FCCM
1998
IEEE
15 years 8 months ago
1998
IEEE
Custom Computing Machines (CCM's) have demonstrated significant performance advantages over general-purpose processors for certain classes of problems. However, problems can ...
127
click to vote
STACS
2001
Springer
15 years 8 months ago
2001
Springer
The stretch factor of a Euclidean graph is the maximum ratio of the distance in the graph between any two points and their Euclidean distance. Given a set S of n points in Rd, we ...