5153 search results - page 554 / 1031 » Introduction to Randomized Algorithms |
151
click to vote
IJCNN
2006
IEEE
16 years 17 days ago
2006
IEEE
—In this paper we propose a new graph-based feature splitting algorithm maxInd, which creates a balanced split maximizing the independence between the two feature sets. We study ...
173
Voted
ADHOCNOW
2006
Springer
16 years 16 days ago
2006
Springer
We consider an ad-hoc network consisting of devices that try to gain access for transmission through a shared communication channel. We redesign randomized protocol of Cai, Lu and ...
167
click to vote
ISIPTA
2005
IEEE
16 years 4 days ago
2005
IEEE
This papers investigates the computation of lower/upper expectations that must cohere with a collection of probabilistic assessments and a collection of judgements of epistemic in...
165
click to vote
ICNC
2005
Springer
16 years 1 days ago
2005
Springer
Abstract. Four local search algorithms are investigated for the phylogenetic tree reconstruction problem under the Maximum Parsimony criterion. A new subtree swapping neighborhood ...
183
click to vote
GECCO
2004
Springer
15 years 12 months ago
2004
Springer
Evolution of quantum circuits faces two major challenges: complex and huge search spaces and the high costs of simulating quantum circuits on conventional computers. In this paper ...