Sciweavers

732 search results - page 88 / 147
» Strongly Non-U-Shaped Learning Results by General Techniques
Sort
View
STOC
2004
ACM
121views Algorithms» more  STOC 2004»
14 years 9 months ago
Lower bounds for dynamic connectivity
We prove an (lg n) cell-probe lower bound on maintaining connectivity in dynamic graphs, as well as a more general trade-off between updates and queries. Our bound holds even if t...
Mihai Patrascu, Erik D. Demaine
ICC
2007
IEEE
128views Communications» more  ICC 2007»
13 years 9 months ago
The Power of Temporal Pattern Processing in Anomaly Intrusion Detection
Abstract— A clear deficiency in most of todays Anomaly Intrusion Detection Systems (AIDS) is their inability to distinguish between a new form of legitimate normal behavior and ...
Mohammad Al-Subaie, Mohammad Zulkernine
ACG
2009
Springer
14 years 3 months ago
Monte-Carlo Tree Search in Settlers of Catan
Abstract. Games are considered important benchmark tasks of artificial intelligence research. Modern strategic board games can typically be played by three or more people, which m...
Istvan Szita, Guillaume Chaslot, Pieter Spronck
SOSP
2009
ACM
14 years 5 months ago
Better I/O through byte-addressable, persistent memory
Modern computer systems have been built around the assumption that persistent storage is accessed via a slow, block-based interface. However, new byte-addressable, persistent memo...
Jeremy Condit, Edmund B. Nightingale, Christopher ...
CONCURRENCY
2002
116views more  CONCURRENCY 2002»
13 years 8 months ago
Parallel implementation of the fluid particle model for simulating complex fluids in the mesoscale
Dissipative particle dynamics (DPD) and its generalization - fluid particle model (FPM) - represent the "fluid particle" approach for simulating fluid-like behavior in t...
Krzysztof Boryczko, Witold Dzwinel, David A. Yuen