451 search results - page 76 / 91 » Temporal Classes and OWL |
95
Voted
CP
2003
Springer
15 years 5 months ago
2003
Springer
Abstract. Combinatorial auctions are an important e-commerce application where bidders can bid on combinations of items. The problem of selecting the best bids that cover all items...
120
click to vote
FORMATS
2003
Springer
15 years 5 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...
133
Voted
CONCUR
1999
Springer
15 years 4 months ago
1999
Springer
Abstract. The paper presents a partial order reduction method applicable to networks of timed automata. The advantage of the method is that it reduces both the number of explored c...
KI
1998
Springer
15 years 4 months ago
1998
Springer
Case-based approaches are employed within a multitude of application areas one of which is the prediction of dynamic behaviour. Given a situation the possible development after a ...
116
click to vote
GECCO
2007
Springer
15 years 4 months ago
2007
Springer
Model Checking is a well-known and fully automatic technique for checking software properties, usually given as temporal logic formulae on the program variables. Most model checke...