Sciweavers

518 search results - page 57 / 104
» Beating a Random Assignment
Sort
View
EMO
2001
Springer
125views Optimization» more  EMO 2001»
15 years 7 months ago
Adapting Weighted Aggregation for Multiobjective Evolution Strategies
The conventional weighted aggregation method is extended to realize multi-objective optimization. The basic idea is that systematically changing the weights during evolution will l...
Yaochu Jin, Tatsuya Okabe, Bernhard Sendhoff
103
Voted
ICPR
2010
IEEE
15 years 5 months ago
Efficient Learning to Label Images
Conditional random field methods (CRFs) have gained popularity for image labeling tasks in recent years. In this paper, we describe an alternative discriminative approach, by exte...
Ke Jia, Li Cheng, Nianjun Liu, Lei Wang
103
Voted
BMVC
2001
15 years 5 months ago
Graph Matching using Adjacency Matrix Markov Chains
This paper describes a spectral method for graph-matching. We adopt a graphical models viewpoint in which the graph adjacency matrix is taken to represent the transition probabili...
Antonio Robles-Kelly, Edwin R. Hancock
137
Voted
DCOSS
2005
Springer
15 years 4 months ago
An Adaptive Blind Algorithm for Energy Balanced Data Propagation in Wireless Sensors Networks
In this paper, we consider the problem of energy balanced data propagation in wireless sensor networks and we generalise previous works by allowing realistic energy assignment. A n...
Pierre Leone, Sotiris E. Nikoletseas, José ...
123
Voted
CISSE
2008
Springer
15 years 4 months ago
A New Methodology for Self Localization in Wireless Sensor Networks
Localization is the subject matter that has allured the attention of many researchers in the field of wireless sensor network. It is the process of assigning or computing the locat...
Allon Rai, Sangita Ale, Syed Sajjad Rizvi, Aasia R...