Sciweavers

578 search results - page 83 / 116
» The Minimum-Entropy Set Cover Problem
Sort
View
JNW
2006
148views more  JNW 2006»
13 years 9 months ago
An Energy Efficient Approach to Dynamic Coverage in Wireless Sensor Networks
Tracking of mobile targets is an important application of sensor networks. This is a non-trivial problem as the increased accuracy of tracking results in an overall reduction in th...
Mohamed Khalil Watfa, Sesh Commuri
PRL
2008
135views more  PRL 2008»
13 years 8 months ago
A hierarchical clustering algorithm based on the Hungarian method
We propose a novel hierarchical clustering algorithm for data-sets in which only pairwise distances between the points are provided. The classical Hungarian method is an efficient...
Jacob Goldberger, Tamir Tassa
NFM
2011
225views Formal Methods» more  NFM 2011»
13 years 3 months ago
Synthesis for PCTL in Parametric Markov Decision Processes
Abstract. In parametric Markov Decision Processes (PMDPs), transition probabilities are not fixed, but are given as functions over a set of parameters. A PMDP denotes a family of ...
Ernst Moritz Hahn, Tingting Han, Lijun Zhang
ICCAD
2005
IEEE
144views Hardware» more  ICCAD 2005»
14 years 5 months ago
An exact algorithm for the maximal sharing of partial terms in multiple constant multiplications
— In this paper we propose an exact algorithm that maximizes the sharing of partial terms in Multiple Constant Multiplication (MCM) operations. We model this problem as a Boolean...
Paulo F. Flores, José C. Monteiro, Eduardo ...
PPSN
2004
Springer
14 years 2 months ago
Multi-objective Optimisation by Co-operative Co-evolution
This paper presents the integration between a co-operative co-evolutionary genetic algorithm (CCGA) and four evolutionary multiobjective optimisation algorithms (EMOAs): a multi-ob...
Kuntinee Maneeratana, Kittipong Boonlong, Nachol C...