9284 search results - page 259 / 1857 » Knowledge State Algorithms |
186
click to vote
FORMATS
2006
Springer
15 years 10 months ago
2006
Springer
We propose a symbolic algorithm for the analysis of the robustness of timed automata, that is the correctness of the model in presence of small drifts on the clocks or imprecision ...
150
click to vote
CORR
2009
Springer
15 years 4 months ago
2009
Springer
Previous work has shown that there are two major complexity barriers in the synthesis of fault-tolerant distributed programs, namely generation of fault-span, the set of states re...
191
click to vote
RECOMB
2005
Springer
16 years 7 months ago
2005
Springer
Abstract. Current approaches for identification and detection of transcription factor binding sites rely on an extensive set of known target genes. Here we describe a novel structu...
162
click to vote
GECCO
2005
Springer
16 years 14 days ago
2005
Springer
Designing technical plants is a complex and demanding process. It has been shown that the optimization of the simple facility placement problem is already NP-hard. Optimization of...
167
click to vote
ICCBR
2005
Springer
16 years 14 days ago
2005
Springer
Typically, case-based recommender systems recommend single items to the on-line customer. In this paper we introduce the idea of recommending a user-defined collection of items whe...