4397 search results - page 166 / 880 » Relational Algebra Operations |
152
click to vote
IAT
2010
IEEE
15 years 1 months ago
2010
IEEE
When its human operator cannot continuously supervise (much less teleoperate) an agent, the agent should be able to recognize its limitations and ask for help when it risks making...
129
Voted
TCS
2010
14 years 10 months ago
2010
In this paper we show that the problem of finding a chordless path between a vertex s and a vertex t containing a vertex v remains NP-complete in bipartite graphs, thereby strengt...
120
click to vote
LATA
2010
Springer
15 years 10 months ago
2010
Springer
Operator precedence languages, designated as Floyd’s Languages (FL) to honor their inventor, are a classical deterministic context-free family. FLs are known to be a boolean fami...
120
click to vote
FOGA
1998
15 years 4 months ago
1998
There has been considerable discussion of the pros/cons of recombination and mutation operators in the context of Holland's schema theory. In this paper we de ne a common fra...
APAL
2005
15 years 3 months ago
2005
We investigate operators which take a set X to a set relatively computably enumerable in and above X by studying which such sets X can be so mapped into the Turing degree of K. We...