808 search results - page 136 / 162 » A scaling algorithm for polynomial constraint satisfaction p... |
CONCUR
2004
Springer
14 years 24 days ago
2004
Springer
In this paper, we study model checking of timed automata (TAs), and more precisely we aim at finding efficient model checking for subclasses of TAs. For this, we consider model ch...
SPIRE
1999
Springer
13 years 11 months ago
1999
Springer
Approximate string matching is an important paradigm in domains ranging from speech recognition to information retrieval and molecular biology. In this paper, we introduce a new f...
MP
2007
13 years 6 months ago
2007
We present a probabilistic analysis of integer linear programs (ILPs). More specifically, we study ILPs in a so-called smoothed analysis in which it is assumed that first an adve...
CORR
2010
Springer
13 years 4 months ago
2010
Springer
In this paper we study the partitioning approach for multiprocessor real-time scheduling. This approach seems to be the easiest since, once the partitioning of the task set has be...
DEBS
2008
ACM
13 years 8 months ago
2008
ACM
Availability of an overlay network is a necessary condition for event delivery in event based systems. The availability of the overlay links depends on the underlying physical net...