635 search results - page 2 / 127 » Some Computational Problems Related to Pseudo-intents |
ECSQARU
2005
Springer
14 years 4 months ago
2005
Springer
This paper briefly considers several research issues, some of which are on-going and some others are for further research. The starting point is that many AI topics, especially th...
CORR
2007
Springer
13 years 10 months ago
2007
Springer
Abstract. The simplex method in Linear Programming motivates several problems of asymptotic convex geometry. We discuss some conjectures and known results in two related directions...
JAR
2006
13 years 10 months ago
2006
In many AI fields, the problem of finding out a solution which is as close as possible to a given configuration has to be faced. This paper addresses this problem in a propositiona...
IPPS
2000
IEEE
14 years 3 months ago
2000
IEEE
Abstract. In this paper, we consider parallelizability of some Pcomplete problems. First we propose a parameter which indicates parallelizability for a convex layers problem. We pr...
TCS
2010
13 years 5 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...