6437 search results - page 108 / 1288 » Parallel Algorithms for Arrangements |
122
Voted
JPDC
2006
15 years 19 days ago
2006
We propose a framework for defining agent-based models (ABMs) and two algorithms for the automatic parallelization of agent-based models, a general version P-ABMG for all ABMs def...
123
Voted
ITIIS
2010
14 years 7 months ago
2010
Rapid growth of internet applications has increased the importance of intrusion detection system (IDS) performance. String matching is the most computation-consuming task in IDS. ...
117
Voted
IPPS
2009
IEEE
15 years 7 months ago
2009
IEEE
Graph-theoretic abstractions are extensively used to analyze massive data sets. Temporal data streams from socioeconomic interactions, social networking web sites, communication t...
ICPP
1998
IEEE
15 years 5 months ago
1998
IEEE
The crew planning problem has been successfully solved on a loosely connected network of workstations (NOW) using advanced computational techniques and efficient communication pat...
125
click to vote
MPC
1995
Springer
15 years 4 months ago
1995
Springer
Abstract. We present a strategy to develop, in a functional setting, correct, e cient and portable Divide-and-Conquer (DC) programs for massively parallel architectures. Starting f...