Sciweavers

1512 search results - page 196 / 303
» When Suboptimal Rules
Sort
View
CSCLP
2007
Springer
15 years 5 months ago
Quasi-Linear-Time Algorithms by Generalisation of Union-Find in CHR
Abstract. The union-find algorithm can be seen as solving simple equations between variables or constants. With a few lines of code change, we generalise its implementation in CHR...
Thom W. Frühwirth
WEBDB
2007
Springer
79views Database» more  WEBDB 2007»
15 years 5 months ago
Navigating Extracted Data with Schema Discovery
Open Information Extraction (OIE) is a recently-introduced type of information extraction that extracts small individual pieces of data from input text without any domainspecific...
Michael J. Cafarella, Dan Suciu, Oren Etzioni
AI
2005
Springer
15 years 5 months ago
ARES 2: A Tool for Evaluating Cooperative and Competitive Multi-agent Systems
The Agent Rescue Emergency Simulator (ARES) system provides a simplified rescue scenario similar to Robocup Rescue for use in the educational or research fields when evaluating m...
Jörg Denzinger, Jordan Kidney
FPL
2005
Springer
137views Hardware» more  FPL 2005»
15 years 5 months ago
Bitwise Optimised CAM for Network Intrusion Detection Systems
String pattern matching is a computationally expensive task, and when implemented in hardware, it can consume a large amount of resources for processing and storage. This paper pr...
Sherif Yusuf, Wayne Luk
UC
2005
Springer
15 years 5 months ago
On Computational Complexity of Counting Fixed Points in Symmetric Boolean Graph Automata
Abstract. We study computational complexity of counting the fixed point configurations (FPs) in certain classes of graph automata viewed as discrete dynamical systems. We prove t...
Predrag T. Tosic, Gul A. Agha