10997 search results - page 320 / 2200 » On the Structure of Complete Sets |
179
click to vote
CSL
2010
Springer
15 years 8 months ago
2010
Springer
We study the complexity of evaluating positive equality-free sentences of first-order (FO) logic over fixed, finite structures B. This may be seen as a natural generalisation of th...
144
Voted
BMCBI
2008
15 years 7 months ago
2008
Background: Sequences and structures provide valuable complementary information on protein features and functions. However, it is not always straightforward for users to gather in...
171
click to vote
MSCS
2007
15 years 6 months ago
2007
We study full completeness and syntactical separability of MLL proof nets with the mix rule. The general method we use consists first in addressing the two questions in the less ...
202
click to vote
COMPSAC
2006
IEEE
16 years 27 days ago
2006
IEEE
The Sage development method and associated tool set support an incremental, iterative, model-driven process to build and maintain high assurance, reactive multi-agent systems. A s...
152
click to vote
AUTOMATICA
2002
15 years 6 months ago
2002
This paper investigates the controllability and reachability of switched linear control systems. It is proven that both the controllable and reachable sets are subspaces of the to...