15033 search results - page 219 / 3007 » Complexity Theory and Algorithms |
162
click to vote
LICS
1999
IEEE
15 years 8 months ago
1999
IEEE
The ordered conjecture states that least fixed-point logic LFP is strictly more expressive than first-order logic FO on every infinite class of ordered finite structures. It has b...
188
click to vote
ITP
2010
15 years 6 months ago
2010
Lebesgue integration is a fundamental concept in many mathematical theories, such as real analysis, probability and information theory. Reported higher-order-logic formalizations o...
121
click to vote
MISQ
2002
15 years 4 months ago
2002
This paper addresses the design problem of providing IT support for emerging knowledge processes (EKPs). EKPs are organizational activity patterns that exhibit three characteristi...
125
click to vote
NN
1998
Springer
15 years 4 months ago
1998
Springer
We experimented on task-level robot learning based on bi-directional theory. The via-point representation was used for ‘learning by watching’. In our previous work, we had a r...
146
click to vote
CODES
2010
IEEE
15 years 2 months ago
2010
IEEE
Due to the ever increasing system complexity, deciding whether a given platform is sufficient to implement a set of applications under given constraints becomes a serious bottlene...