Sciweavers

1168 search results - page 44 / 234
» cases 2000
Sort
View
IPL
2000
69views more  IPL 2000»
13 years 7 months ago
Generating all maximal models of a Boolean expression
We examine the computational problem of generating all maximal models of a Boolean expression in CNF. We give a resolution-like method that reduces the unnegated variables of an e...
Dimitris J. Kavvadias, Martha Sideri, Elias C. Sta...
IJON
2000
72views more  IJON 2000»
13 years 7 months ago
Delay adaptation in the nervous system
Time delays are ubiquitous in the nervous system. Empirical "ndings suggest that time delays are adapted when considering the synchronous activity of neurons. We introduce a ...
Christian W. Eurich, Klaus Pawelzik, Udo Ernst, An...
IRMA
2000
13 years 9 months ago
EMC - A modeling method for developing web-based applications
Early information systems were mainly built around secondary, administrative processes of the value chain (e.g. accounting). But since the internet came into use, more and more pr...
Peter Rittgen
COMBINATORICS
2000
101views more  COMBINATORICS 2000»
13 years 7 months ago
Bound Graph Polysemy
Bound polysemy is the property of any pair (G1, G2) of graphs on a shared vertex set V for which there exists a partial order on V such that any pair of vertices has an upper boun...
Paul J. Tanenbaum
JAMDS
2000
61views more  JAMDS 2000»
13 years 7 months ago
A coupling technique for stochastic comparison of functions of Markov Processes
The aim of this work is to obtain explicit conditions (i.e., conditions on the transition rates) for the stochastic comparison of Markov Processes. A general coupling technique is ...
M. Doisy