2981 search results - page 548 / 597 » Answer Set Planning |
159
click to vote
SI3D
2009
ACM
16 years 24 days ago
2009
ACM
Populating virtual environments (VEs) with large crowds is a subject that has been tackled for several years. Solutions have been proposed to offer realistic trajectories as well ...
165
click to vote
STACS
2009
Springer
16 years 24 days ago
2009
Springer
The edit distance problem is a classical fundamental problem in computer science in general, and in combinatorial pattern matching in particular. The standard dynamic-programming s...
163
click to vote
FOCS
2009
IEEE
16 years 23 days ago
2009
IEEE
— We show that for every fixed k, there is a linear time algorithm that decides whether or not a given graph has a vertex set X of order at most k such that G − X is planar (w...
171
click to vote
FOCS
2009
IEEE
16 years 23 days ago
2009
IEEE
Polynomial time preprocessing to reduce instance size is one of the most commonly deployed heuristics to tackle computationally hard problems. In a parameterized problem, every in...
159
click to vote
COCO
2009
Springer
16 years 17 days ago
2009
Springer
—The Gap-Hamming-Distance problem arose in the context of proving space lower bounds for a number of key problems in the data stream model. In this problem, Alice and Bob have to...