10718 search results - page 649 / 2144 » On the Circuit Implementation Problem |
195
click to vote
STACS
2010
Springer
16 years 2 months ago
2010
Springer
Reachability and shortest path problems are NL-complete for general graphs. They are known to be in L for graphs of tree-width 2 [14]. However, for graphs of treewidth larger than ...
207
click to vote
COMPGEOM
1995
ACM
15 years 11 months ago
1995
ACM
A convex polytope P can be speci ed in two ways: as the convex hull of the vertex set V of P, or as the intersection of the set H of its facet-inducing halfspaces. The vertex enum...
260
click to vote
AAAI
2008
15 years 8 months ago
2008
Symbolic AI systems typically have difficulty reasoning about motion in continuous environments, such as determining whether a cornering car will clear a close obstacle. Bimodal s...
169
Voted
IJMMS
1998
15 years 7 months ago
1998
The knowledge-engineering literature contains a number of approaches for constructing or selecting problem solvers. Some of these approaches are based on indexing and selecting a ...
175
click to vote
FSEN
2007
Springer
16 years 1 months ago
2007
Springer
Abstract. During the last years, timed automata have become a popular model for describing the behaviour of real-time systems. In particular, there has been much research on proble...