Sciweavers

19866 search results - page 3630 / 3974
» Computing all factorizations in ***
Sort
View
ICPP
1990
IEEE
15 years 11 months ago
Reducing Memory and Traffic Requirements for Scalable Directory-Based Cache Coherence Schemes
As multiprocessors are scaled beyond single bus systems, there is renewed interest in directory-based cache coherence schemes. These schemes rely on a directory to keep track of a...
Anoop Gupta, Wolf-Dietrich Weber, Todd C. Mowry
SIGCSE
1990
ACM
126views Education» more  SIGCSE 1990»
15 years 11 months ago
A philosophy and example of CS-1 programming projects
This paper presents a philosophy underlying CS-1 programming projects, and illustrates this philosophy with a concrete example. Integral to the philosophy is the use of Ada packag...
Richard E. Pattis
ACSAC
2009
IEEE
15 years 10 months ago
A Network Access Control Mechanism Based on Behavior Profiles
Abstract--Current Network Access Control (NAC) technologies manage the access of new devices into a network to prevent rogue devices from attacking network hosts or services. Typic...
Vanessa Frías-Martínez, Joseph Sherr...
ANCS
2007
ACM
15 years 10 months ago
Ruler: high-speed packet matching and rewriting on NPUs
Programming specialized network processors (NPU) is inherently difficult. Unlike mainstream processors where architectural features such as out-of-order execution and caches hide ...
Tomas Hruby, Kees van Reeuwijk, Herbert Bos
ATAL
2007
Springer
15 years 10 months ago
Hypotheses refinement under topological communication constraints
We investigate the properties of a multiagent system where each (distributed) agent locally perceives its environment. Upon perception of an unexpected event, each agent locally c...
Gauvain Bourgne, Gael Hette, Nicolas Maudet, Suzan...
« Prev « First page 3630 / 3974 Last » Next »