244 search results - page 44 / 49 » Intervalizing k-Colored Graphs |
COLT
2008
Springer
15 years 3 months ago
2008
Springer
We analyze a sequential game between a Gambler and a Casino. The Gambler allocates bets from a limited budget over a fixed menu of gambling events that are offered at equal time i...
104
click to vote
CP
2008
Springer
15 years 2 months ago
2008
Springer
It is acknowledged that the symbolic form of the equations is crucial for interval-based solving techniques to efficiently handle systems of equations over the reals. However, only...
113
click to vote
ATMOS
2007
15 years 2 months ago
2007
The optimal track allocation problem (OPTRA) is to find, in a given railway network, a conflict free set of train routes of maximum value. We study two types of integer programmi...
117
click to vote
DEXA
2010
Springer
15 years 1 months ago
2010
Springer
Given a spatio-temporal network (ST network) whose edge properties vary with time, a time-sub-interval minimum spanning tree (TSMST) is a collection of distinct minimum spanning t...
ENTCS
2002
15 years 29 days ago
2002
In this work we present Zeus, a Distributed Model-Checker that evolves from the tool Kronos [8] and that currently can handle backwards computation of TCTLreachability properties ...