Sciweavers

225 search results - page 43 / 45
» A Least-Certainty Heuristic for Selective Search
Sort
View
IAT
2009
IEEE
14 years 3 months ago
Cluster-Swap: A Distributed K-median Algorithm for Sensor Networks
In building practical sensor networks, it is often beneficial to use only a subset of sensors to take measurements because of computational, communication, and power limitations....
Yoonheui Kim, Victor R. Lesser, Deepak Ganesan, Ra...
CIKM
2009
Springer
14 years 3 months ago
Fast shortest path distance estimation in large networks
In this paper we study approximate landmark-based methods for point-to-point distance estimation in very large networks. These methods involve selecting a subset of nodes as landm...
Michalis Potamias, Francesco Bonchi, Carlos Castil...
GECCO
2007
Springer
176views Optimization» more  GECCO 2007»
14 years 3 months ago
Two-level of nondominated solutions approach to multiobjective particle swarm optimization
In multiobjective particle swarm optimization (MOPSO) methods, selecting the local best and the global best for each particle of the population has a great impact on the convergen...
M. A. Abido
ACSC
2003
IEEE
14 years 2 months ago
A Comparative Study for Domain Ontology Guided Feature Extraction
We introduced a novel method employing a hierarchical domain ontology structure to extract features representing documents in our previous publication (Wang 2002). All raw words i...
Bill B. Wang, Robert I. McKay, Hussein A. Abbass, ...
CP
2001
Springer
14 years 1 months ago
A CLP Approach to the Protein Side-Chain Placement Problem
Abstract. Selecting conformations for side-chains is an important subtask in building three-dimensional protein models. Side-chain placement is a difficult problem because of the l...
Martin T. Swain, Graham J. L. Kemp