Sciweavers

3897 search results - page 349 / 780
» complexity 2010
Sort
View
AI
2010
Springer
15 years 6 months ago
Reasoning under inconsistency: A forgetting-based approach
In this paper, a fairly general framework for reasoning from inconsistent propositional bases is defined. Variable forgetting is used as a basic operation for weakening pieces of ...
Jérôme Lang, Pierre Marquis
CORR
2010
Springer
83views Education» more  CORR 2010»
15 years 6 months ago
Sentence Simplification Aids Protein-Protein Interaction Extraction
Accurate systems for extracting ProteinProtein Interactions (PPIs) automatically from biomedical articles can help accelerate biomedical research. Biomedical Informatics researche...
Siddhartha Jonnalagadda, Graciela Gonzalez
CORR
2010
Springer
63views Education» more  CORR 2010»
15 years 6 months ago
Position Analysis of the RRP-3(SS) Multi-Loop Spatial Structure
The paper presents the position analysis of a spatial structure composed of two platforms mutually connected by one RRP and three SS serial kinematic chains, where R, P, and S sta...
Carlo Innocenti, Philippe Wenger
CORR
2010
Springer
113views Education» more  CORR 2010»
15 years 6 months ago
Traffic Capacity of Large WDM Passive Optical Networks
As passive optical networks (PON) are increasingly deployed to provide high speed Internet access, it is important to understand their fundamental traffic capacity limits. The pape...
Nelson Antunes, Christine Fricker, Philippe Robert...
CORR
2010
Springer
95views Education» more  CORR 2010»
15 years 6 months ago
Deciding the finiteness of the number of simple permutations contained in a wreath-closed class is polynomial
We present an algorithm running in time O(n log n) which decides if a wreathclosed permutation class Av(B) given by its finite basis B contains a finite number of simple permutati...
Frédérique Bassino, Mathilde Bouvel,...