Sciweavers

113 search results - page 17 / 23
» On the expected value of the minimum assignment
Sort
View
HICSS
2002
IEEE
89views Biometrics» more  HICSS 2002»
15 years 2 months ago
Nash Strategies for Load Serving Entities in Dynamic Energy Multi-markets
In this paper the problem of developing bidding strategies for the participants of dynamic energy-multi markets is studied. Attention is given to strategic bidding of load serving...
Jose B. Cruz Jr., Ashkan Kian
ESEM
2007
ACM
15 years 1 months ago
The Effects of Over and Under Sampling on Fault-prone Module Detection
The goal of this paper is to improve the prediction performance of fault-prone module prediction models (fault-proneness models) by employing over/under sampling methods, which ar...
Yasutaka Kamei, Akito Monden, Shinsuke Matsumoto, ...
IJCM
2002
92views more  IJCM 2002»
14 years 9 months ago
Random-tree Diameter and the Diameter-constrained MST
A minimum spanning tree (MST) with a small diameter is required in numerous practical situations. It is needed, for example, in distributed mutual exclusion algorithms in order to...
Ayman Abdalla, Narsingh Deo
CORR
1999
Springer
98views Education» more  CORR 1999»
14 years 9 months ago
A variational description of the ground state structure in random satisfiability problems
A variational approach to finite connectivity spin-glass-like models is developed and applied to describe the structure of optimal solutions in random satisfiability problems. Our ...
Giulio Biroli, Rémi Monasson, Martin Weigt
ICTAI
2009
IEEE
14 years 7 months ago
A Generalized Cyclic-Clustering Approach for Solving Structured CSPs
We propose a new method for solving structured CSPs which generalizes and improves the Cyclic-Clustering approach [4]. First, the cutset and the tree-decomposition of the constrai...
Cédric Pinto, Cyril Terrioux