4377 search results - page 84 / 876 » Mass problems and randomness |
102
click to vote
MCS
2009
Springer
15 years 2 months ago
2009
Springer
Abstract. Data with multi-valued categorical attributes can cause major problems for decision trees. The high branching factor can lead to data fragmentation, where decisions have ...
SODA
1998
ACM
14 years 11 months ago
1998
ACM
We consider the problem of on-line call admission and routing on trees and meshes. Previous work gave randomized on-line algorithms for these problems and proved that they have opt...
APPROX
2007
Springer
15 years 4 months ago
2007
Springer
We consider situations in which a decision-maker with a fixed budget faces a sequence of options, each with a cost and a value, and must select a subset of them online so as to ma...
ALENEX
2007
14 years 11 months ago
2007
We present a novel randomized approach to the graph isomorphism problem. Our algorithm aims at solving difficult instances by producing randomized certificates for non-isomorphis...
COCO
2008
Springer
14 years 11 months ago
2008
Springer
We prove that the weighted monotone circuit satisfiability problem has no fixed-parameter tractable approximation algorithm with constant or polylogarithmic approximation ratio un...