Sciweavers

641 search results - page 67 / 129
» Branch and Bound Algorithm Selection by Performance Predicti...
Sort
View
VLSID
2006
IEEE
112views VLSI» more  VLSID 2006»
15 years 3 months ago
Handling Constraints in Multi-Objective GA for Embedded System Design
Design space exploration is central to embedded system design. Typically this is a multi-objective search problem, where performance, power, area etc. are the different optimizati...
Biman Chakraborty, Ting Chen, Tulika Mitra, Abhik ...
IJCNN
2007
IEEE
15 years 4 months ago
A Wrapper for Projection Pursuit Learning
– Constructive algorithms are effective methods for designing Artificial Neural Networks (ANN) with good accuracy and generalization capability, yet with parsimonious network str...
Leonardo M. Holschuh, Clodoaldo Ap. M. Lima, Ferna...
INFOCOM
2007
IEEE
15 years 4 months ago
Landmark Selection and Greedy Landmark-Descent Routing for Sensor Networks
—We study the problem of landmark selection for landmark-based routing in a network of fixed wireless communication nodes. We present a distributed landmark selection algorithm ...
An Nguyen, Nikola Milosavljevic, Qing Fang, Jie Ga...
IDEAL
2004
Springer
15 years 3 months ago
Prediction of Implicit Protein-Protein Interaction by Optimal Associative Feature Mining
Proteins are known to perform a biological function by interacting with other proteins or compounds. Since protein–protein interaction is intrinsic to most cellular processes, pr...
Jae-Hong Eom, Jeong Ho Chang, Byoung-Tak Zhang
ESWA
2008
169views more  ESWA 2008»
14 years 9 months ago
Predicting opponent's moves in electronic negotiations using neural networks
Electronic negotiation experiments provide a rich source of information about relationships between the negotiators, their individual actions, and the negotiation dynami...
Réal Carbonneau, Gregory E. Kersten, Rustam...