1263 search results - page 38 / 253 » A* with Bounded Costs |
FSTTCS
2005
Springer
15 years 3 months ago
2005
Springer
Abstract. We consider a generalization of the set cover problem, in which elements are covered by pairs of objects, and we are required to find a minimum cost subset of objects th...
SODA
2012
ACM
13 years 4 days ago
2012
ACM
We study the role that parallelism plays in time complexariants of Winfree’s abstract Tile Assembly Model (aTAM), a model of molecular algorithmic self-assembly. In the “hiera...
91
Voted
BMCBI
2010
14 years 9 months ago
2010
Background: Determining a suitable sample size is an important step in the planning of microarray experiments. Increasing the number of arrays gives more statistical power, but ad...
SIROCCO
2010
14 years 11 months ago
2010
Abstract. Two mobile agents (robots) have to meet in an a priori unknown bounded terrain modeled as a polygon, possibly with polygonal obstacles. Robots are modeled as points, and ...
112
Voted
LCTRTS
2010
Springer
14 years 11 months ago
2010
Springer
In preemptive real-time systems, scheduling analyses need—in addition to the worst-case execution time—the context-switch cost. In case of preemption, the preempted and the pr...