Sciweavers

10447 search results - page 1979 / 2090
» The Philosophy of Computer Science
Sort
View
IANDC
2006
121views more  IANDC 2006»
15 years 4 months ago
Comparing operational models of name-passing process calculi
We study three operational models of name-passing process calculi: coalgebras on (pre)sheaves, indexed labelled transition systems, and history dependent automata. The coalgebraic...
Marcelo P. Fiore, Sam Staton
CN
2007
168views more  CN 2007»
15 years 4 months ago
Network anomaly detection with incomplete audit data
With the ever increasing deployment and usage of gigabit networks, traditional network anomaly detection based Intrusion Detection Systems (IDS) have not scaled accordingly. Most,...
Animesh Patcha, Jung-Min Park
JANCL
2008
109views more  JANCL 2008»
15 years 4 months ago
Conditionalization and total knowledge
This paper employs epistemic logic to investigate the philosophical foundations of Bayesian updating in belief revision. By Bayesian updating, we understand the tenet that an agen...
Ian Pratt-Hartmann
133
Voted
CORR
2007
Springer
100views Education» more  CORR 2007»
15 years 4 months ago
Interference Automata
We propose a computing model, the Two-Way Optical Interference Automata (2OIA), that makes use of the phenomenon of optical interference. We introduce this model to investigate th...
M. V. Panduranga Rao
JCSS
2008
81views more  JCSS 2008»
15 years 4 months ago
A simulator for adaptive parallel applications
Dynamically allocating computing nodes to parallel applications is a promising technique for improving the utilization of cluster resources. Detailed simulations can help identify...
Basile Schaeli, Sebastian Gerlach, Roger D. Hersch
« Prev « First page 1979 / 2090 Last » Next »