Sciweavers

1142 search results - page 96 / 229
» Approximability of Clausal Constraints
Sort
View
APN
2006
Springer
15 years 10 months ago
A New Approach to the Evaluation of Non Markovian Stochastic Petri Nets
Abstract. In this work, we address the problem of transient and steadystate analysis of a stochastic Petri net which includes non Markovian distributions with a finite support but ...
Serge Haddad, Lynda Mokdad, Patrice Moreaux
IJCAI
2007
15 years 7 months ago
A Scalable Kernel-Based Algorithm for Semi-Supervised Metric Learning
In recent years, metric learning in the semisupervised setting has aroused a lot of research interests. One type of semi-supervised metric learning utilizes supervisory informatio...
Dit-Yan Yeung, Hong Chang, Guang Dai
AMC
2005
112views more  AMC 2005»
15 years 6 months ago
Stieltjes moment problem via fractional moments
Stieltjes moment problem is considered to recover a probability density function from the knowledge of its infinite sequence of ordinary moments. The approximate density is obtain...
Pierluigi Novi Inverardi, Alberto Petri, Giorgio P...
CCE
2004
15 years 6 months ago
Computational studies using a novel simplicial-approximation based algorithm for MINLP optimization
Significant advances have been made in the last two decades for the effective solution of mixed integer non-linear programming (MINLP) problems, mainly by exploiting the special s...
Vishal Goyal, Marianthi G. Ierapetritou
FOCS
2008
IEEE
16 years 26 days ago
Degree Bounded Network Design with Metric Costs
Given a complete undirected graph, a cost function on edges and a degree bound B, the degree bounded network design problem is to find a minimum cost simple subgraph with maximum...
Yuk Hei Chan, Wai Shing Fung, Lap Chi Lau, Chun Ko...