Sciweavers

372 search results - page 14 / 75
» A Study of The Fragile Base Class Problem
Sort
View
AMAI
1999
Springer
13 years 10 months ago
Maintenance scheduling problems as benchmarks for constraint algorithms
The paper focuses on evaluating constraint satisfaction search algorithms on application based random problem instances. The application we use is a well-studied problem in the el...
Daniel Frost, Rina Dechter
PERCOM
2007
ACM
14 years 9 months ago
Analytical modeling and mitigation techniques for the energy hole problem in sensor networks
In this paper we investigate the problem of uneven energy consumptions in a large class of many-to-one sensor networks. In a many-to-one sensor network, all sensor nodes generate ...
Jian Li, Prasant Mohapatra
ICALP
2010
Springer
14 years 3 months ago
Preprocessing of Min Ones Problems: A Dichotomy
Min Ones Constraint Satisfaction Problems, i.e., the task of finding a satisfying assignment with at most k true variables (Min Ones SAT(Γ)), can express a number of interesting ...
Stefan Kratsch, Magnus Wahlström
ESORICS
2010
Springer
13 years 11 months ago
On Bounding Problems of Quantitative Information Flow
Abstract. Researchers have proposed formal definitions of quantitative information flow based on information theoretic notions such as the Shannon entropy, the min entropy, the gue...
Hirotoshi Yasuoka, Tachio Terauchi
CIVR
2005
Springer
123views Image Analysis» more  CIVR 2005»
14 years 3 months ago
Region-Based Image Clustering and Retrieval Using Multiple Instance Learning
Multiple Instance Learning (MIL) is a special kind of supervised learning problem that has been studied actively in recent years. We propose an approach based on One-Class Support ...
Chengcui Zhang, Xin Chen