7106 search results - page 780 / 1422 » Restricted Complexity, General Complexity |
207
click to vote
JACM
2000
15 years 7 months ago
2000
A simple variant of a priority queue, called a soft heap, is introduced. The data structure supports the usual operations: insert, delete, meld, and findmin. Its novelty is to beat...
179
click to vote
EXPERT
1998
15 years 7 months ago
1998
This article illustrates the complexities of real-world planning and how we can create AI planning systems to address them. We describe the IMACS Project (Interactive Manufacturab...
244
click to vote
PAMI
2002
15 years 7 months ago
2002
Decomposing video frames into coherent two-dimensional motion layers is a powerful method for representing videos. Such a representation provides an intermediate description that e...
280
click to vote
MST
2010
15 years 2 months ago
2010
We study local, distributed algorithms for the capacitated minimum dominating set (CapMDS) problem, which arises in various distributed network applications. Given a network graph...
245
click to vote
CORR
2011
Springer
14 years 11 months ago
2011
Springer
We propose a logical/mathematical framework for statistical parameter learning of parameterized logic programs, i.e. de nite clause programs containing probabilistic facts with a ...