Sciweavers

2157 search results - page 402 / 432
» Binary ant algorithm
Sort
View
ALGORITHMICA
2010
112views more  ALGORITHMICA 2010»
14 years 12 months ago
On Sorting, Heaps, and Minimum Spanning Trees
Let A be a set of size m. Obtaining the first k m elements of A in ascending order can be done in optimal O(m + k log k) time. We present Incremental Quicksort (IQS), an algorith...
Gonzalo Navarro, Rodrigo Paredes
BMCBI
2007
194views more  BMCBI 2007»
14 years 12 months ago
Kernel-imbedded Gaussian processes for disease classification using microarray gene expression data
Background: Designing appropriate machine learning methods for identifying genes that have a significant discriminating power for disease outcomes has become more and more importa...
Xin Zhao, Leo Wang-Kit Cheung
KI
2006
Springer
14 years 11 months ago
A Framework for Quasi-exact Optimization Using Relaxed Best-First Search
Abstract. In this paper, a framework for previous and new quasi-exact extensions of the A -algorithm is presented. In contrast to previous approaches, the new methods guarantee to ...
Rüdiger Ebendt, Rolf Drechsler
ICRA
2010
IEEE
222views Robotics» more  ICRA 2010»
14 years 10 months ago
Pose estimation in heavy clutter using a multi-flash camera
We propose a novel solution to object detection, localization and pose estimation with applications in robot vision. The proposed method is especially applicable when the objects ...
Ming-Yu Liu, Oncel Tuzel, Ashok Veeraraghavan, Ram...
TON
2010
157views more  TON 2010»
14 years 6 months ago
Random Access Game and Medium Access Control Design
We study the contention/interaction among wireless nodes and med -ium access control design in game theory framework. We define a general class of games, called random access game...
Lijun Chen, Steven H. Low, John C. Doyle