18306 search results - page 152 / 3662 » Algorithmics in Exponential Time |
APAL
2007
14 years 10 months ago
2007
We study a refined framwork of parameterized complexity theory where the parameter dependendence of fixed-parameter tractable algorithms is not arbitrary, but restricted by a fu...
AMC
2006
14 years 10 months ago
2006
A new methodology for the reliability evaluation of an l-dissimilar-unit non-repairable cold-standby redundant system is introduced in this paper. Each unit is composed of a numbe...
CORR
2010
Springer
14 years 5 months ago
2010
Springer
We construct two families of deterministic sensing matrices where the columns are obtained by exponentiating codewords in the quaternary Delsarte-Goethals code DG(m, r). This meth...
JMLR
2010
14 years 4 months ago
2010
Round-based games are an instance of discrete planning problems. Some of the best contemporary game tree search algorithms use random roll-outs as data. Relying on a good policy, ...
181
click to vote
Publication
The size of computer networks, along with their bandwidths, is growing exponentially. To support these large, high-speed networks, it is neccessary to be able to forward packets in...