Sciweavers

4218 search results - page 31 / 844
» Complete sets of cooperations
Sort
View
IJISEC
2008
188views more  IJISEC 2008»
13 years 6 months ago
Complete analysis of configuration rules to guarantee reliable network security policies
Abstract The use of different network security components, such as firewalls and network intrusion detection systems (NIDSs), is the dominant method to monitor and guarantee the se...
Joaquín García-Alfaro, Nora Boulahia...
JSYML
2010
107views more  JSYML 2010»
13 years 6 months ago
A proof of completeness for continuous first-order logic
Continuous first-order logic has found interest among model theorists who wish to extend the classical analysis of “algebraic” structures (such as fields, group, and graphs) ...
Arthur Paul Pedersen, Itay Ben-Yaacov
DAGSTUHL
2007
13 years 9 months ago
Measuring Ranks via the Complete Laws of Iterated Contraction
: Ranking theory delivers an account of iterated contraction; each ranking function induces a specific iterated contraction behavior. The paper gives a complete axiomatization of t...
Wolfgang Spohn
SIAMDM
2008
122views more  SIAMDM 2008»
13 years 7 months ago
Cycle Systems in the Complete Bipartite Graph Plus a One-Factor
Let Kn,n denote the complete bipartite graph with n vertices in each partite set and Kn,n +I denote Kn,n with a 1-factor added. It is proved in this paper that there exists an m-c...
Liqun Pu, Hao Shen, Jun Ma, San Ling
EOR
2002
79views more  EOR 2002»
13 years 7 months ago
Fast fully polynomial approximation schemes for minimizing completion time variance
Abstract. We present fully polynomial approximation schemes for the problem of minimizing completion time variance of a set of n jobs on a single machine. The fastest of these sche...
Wieslaw Kubiak, Jinliang Cheng, Mikhail Y. Kovalyo...