4171 search results - page 402 / 835 » Choice numbers of graphs |
219
click to vote
CP
2003
Springer
16 years 5 days ago
2003
Springer
Abstract. Many real world problems, e.g. personnel scheduling and transportation planning, can be modeled naturally as Constrained Shortest Path Problems (CSPPs), i.e., as Shortest...
212
click to vote
STACS
2010
Springer
16 years 2 days ago
2010
Springer
Abstract. In the constraint satisfaction problem (CSP), the aim is to find an assignment of values to a set of variables subject to specified constraints. In the minimum cost hom...
216
click to vote
CSMR
2002
IEEE
15 years 12 months ago
2002
IEEE
Static analysis aims at recovering the structure of a software system, while dynamic analysis focuses on its run time behaviour. We propose a technique for combining the analysis ...
193
click to vote
CONCUR
2000
Springer
15 years 11 months ago
2000
Springer
Abstract. We consider the problem of automatically verifying realtime systems with continuously distributed random delays. We generalise probabilistic timed automata introduced in ...
151
click to vote
ASYNC
1998
IEEE
15 years 11 months ago
1998
IEEE
We present the XDI Model for specifying delay-insensitive circuits, that is, reactive systems that correctly exchange signals with their environment in spite of unknown delays inc...