Sciweavers

1712 search results - page 336 / 343
» A Computational Approach to Binding Theory
Sort
View
ISIPTA
2003
IEEE
120views Mathematics» more  ISIPTA 2003»
15 years 5 months ago
Towards a Chaotic Probability Model for Frequentist Probability: The Univariate Case
We adopt the same mathematical model of a set M of probability measures as is central to the theory of coherent imprecise probability. However, we endow this model with an objecti...
Pablo Ignacio Fierens, Terrence L. Fine
ICAIL
2003
ACM
15 years 5 months ago
Improving Legal Quality - an application report
Problems with legal quality will not only increase effort and costs of the law enforcement organisations, but also undermines the regulating power of the legislator. Unintended us...
Tom M. van Engers, Margherita R. Boekenoogen
MOBICOM
2003
ACM
15 years 5 months ago
Throughput capacity of random ad hoc networks with infrastructure support
In this paper, we consider the transport capacity of ad hoc networks with a random flat topology under the present support of an infinite capacity infrastructure network. Such a...
Ulas C. Kozat, Leandros Tassiulas
ASM
2003
ASM
15 years 5 months ago
A Framework for Proving Contract-Equipped Classes
r in: Abstract State Machines 2003 — Advances in Theory and Applications, Proc. 10th International Workshop, Taormina, Italy, March 3-7, 2003, eds. Egon Boerger, Angelo Gargantin...
Bertrand Meyer
GECCO
2010
Springer
155views Optimization» more  GECCO 2010»
15 years 4 months ago
Negative selection algorithms without generating detectors
Negative selection algorithms are immune-inspired classifiers that are trained on negative examples only. Classification is performed by generating detectors that match none of ...
Maciej Liskiewicz, Johannes Textor