Sciweavers

1272 search results - page 142 / 255
» The Set Cover with Pairs Problem
Sort
View
CONSTRAINTS
2007
46views more  CONSTRAINTS 2007»
13 years 10 months ago
Local-search Extraction of MUSes
SAT is probably one of the most-studied constraint satisfaction problems. In this paper, a new hybrid technique based on local search is introduced in order to approximate and ext...
Éric Grégoire, Bertrand Mazure, C&ea...
JNW
2006
148views more  JNW 2006»
13 years 10 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 10 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
EMNLP
2010
13 years 8 months ago
Using Unknown Word Techniques to Learn Known Words
Unknown words are a hindrance to the performance of hand-crafted computational grammars of natural language. However, words with incomplete and incorrect lexical entries pose an e...
Kostadin Cholakov, Gertjan van Noord
NFM
2011
225views Formal Methods» more  NFM 2011»
13 years 5 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