450 search results - page 60 / 90 » Estimating Search Tree Size |
CPM
2005
Springer
14 years 1 months ago
2005
Springer
In this paper we propose new solution methods for designing tag sets for use in universal DNA arrays. First, we give integer linear programming formulations for two previous formal...
COMPSAC
2002
IEEE
14 years 17 days ago
2002
IEEE
Services for locating mobile objects are often organized as a distributed search tree. The advantage of such an organization is that the service can easily scale as a distributed ...
IJCAI
2003
13 years 9 months ago
2003
Given a set of numbers, and a set of bins of fixed capacity, the NP-complete problem of bin packing is to find the minimum number of bins needed to contain the numbers, such that ...
FSTTCS
2010
Springer
13 years 5 months ago
2010
Springer
We study the average number of transitions in Glushkov automata built from random regular expressions. This statistic highly depends on the probabilistic distribution set on the e...
IJCAI
2001
13 years 9 months ago
2001
Most formulations of Reinforcement Learning depend on a single reinforcement reward value to guide the search for the optimal policy solution. If observation of this reward is rar...