Sciweavers

1404 search results - page 118 / 281
» Complexity of admissible rules
Sort
View
ADL
1997
Springer
125views Digital Library» more  ADL 1997»
14 years 1 months ago
Error Tolerant Document Structure Analysis
Successful applications of digital libraries require structured access to sources of information. This paper presents an approach to extract the logical structure of text document...
Bertin Klein, Peter Fankhauser
ICPADS
1996
IEEE
14 years 1 months ago
Transactional programming for distributed agent systems
A new multiagent programmingparadigm based on the transactional logic model' is developed. This paradigm enables us to construct a Distributed agent transactional program (DA...
V. K. Murthy
KR
1992
Springer
14 years 1 months ago
Order of Magnitude Reasoning using Logarithms
Converting complex equations into simpler, more tractable equations usually involves approximation. Approximation is usually done by identifying and removing insignificant terms, ...
P. Pandurang Nayak
DEBS
2007
ACM
14 years 28 days ago
Temporal order optimizations of incremental joins for composite event detection
Queries for composite events typically involve the four complementary dimensions of event data, event composition, relationships between events (esp. temporal and causal), and acc...
François Bry, Michael Eckert
PARLE
1987
14 years 14 days ago
Emulating Digital Logic using Transputer Networks (very High Parallelism = Simplicity = Performance)
Modern VLSI technology has changed the economic rules by which the balance between processing power, memory and communications is decided in computing systems. This will have a pr...
Peter H. Welch