4860 search results - page 407 / 972 » SNPs Problems, Complexity, and Algorithms |
169
click to vote
CORR
2011
Springer
15 years 1 months ago
2011
Springer
Spatial search problems abound in the real world, from locating hidden nuclear or chemical sources to finding skiers after an avalanche. We exemplify the formalism and solution fo...
176
click to vote
APPROX
2008
Springer
15 years 8 months ago
2008
Springer
Abstract. We are interested in efficient algorithms for generating random samples from geometric objects such as Riemannian manifolds. As a step in this direction, we consider the ...
156
Voted
DCC
2004
IEEE
16 years 6 months ago
2004
IEEE
A steepest descent based bit allocation method with polynomial iteration complexity for minimizing the sum of frame distortions under a total bit rate constraint is presented for ...
189
click to vote
GD
2005
Springer
16 years 8 days ago
2005
Springer
This paper presents a new framework for drawing graphs in three dimensions. In general, the new framework uses a divide and conquer approach. More specifically, the framework divi...
241
click to vote
AAAI
2004
15 years 8 months ago
2004
In this paper, we present a general technique for taking forward-chaining planners for deterministic domains (e.g., HSP, TLPlan, TALplanner, and SHOP2) and adapting them to work i...