Sciweavers

1960 search results - page 49 / 392
» The Logic of Large Enough
Sort
View
RECONFIG
2008
IEEE
224views VLSI» more  RECONFIG 2008»
14 years 2 months ago
Automatic Construction of Large-Scale Regular Expression Matching Engines on FPGA
—We present algorithms for implementing large-scale regular expression matching (REM) on FPGA. Based on the proposed algorithms, we develop tools that first transform regular ex...
Yi-Hua E. Yang, Viktor K. Prasanna
ICAI
2007
13 years 9 months ago
Mining and Dynamic Simulation of Sub-Networks from Large Biomolecular Networks
Biomolecular networks dynamically respond to stimuli and implement cellular function. Understanding these dynamic changes is the key challenge for cell biologists. As biomolecular...
Xiaohua Hu, Fang-Xiang Wu, Michael K. Ng, Bahrad A...
AAAI
2008
13 years 8 months ago
Reasoning about Large Taxonomies of Actions
We design a representation based on the situation calculus to facilitate development, maintenance and elaboration of very large taxonomies of actions. This representation leads to...
Yilan Gu, Mikhail Soutchanski
ELECTRONICMARKETS
2010
124views more  ELECTRONICMARKETS 2010»
13 years 5 months ago
The difficulty of studying inter-organisational IS phenomena on large scales: critical reflections on a research journey
We argue that certain theoretical commitments that underpin much existing Interorganisational Information Systems (IOIS) research at small scales become untenable when IOIS are st...
Kai Reimers, Robert B. Johnston, Stefan Klein
ICLP
2009
Springer
14 years 8 months ago
A Language for Large Ensembles of Independently Executing Nodes
We address how to write programs for distributed computing systems in which the network topology can change dynamically. Examples of such systems, which we call ensembles, include ...
Michael P. Ashley-Rollman, Peter Lee, Seth Copen G...