Sciweavers

4451 search results - page 658 / 891
» On Random Ordering Constraints
Sort
View
ICWS
2007
IEEE
15 years 8 months ago
Improved Adaptation of Web Service Compositions Using Value of Changed Information
Workflows often operate in volatile environments in which the component services’ QoS changes frequently. Optimally adapting to these changes becomes an important problem that ...
Girish Chafle, Prashant Doshi, John Harney, Sumit ...
UAI
2008
15 years 8 months ago
Efficient Inference in Persistent Dynamic Bayesian Networks
Numerous temporal inference tasks such as fault monitoring and anomaly detection exhibit a persistence property: for example, if something breaks, it stays broken until an interve...
Tomás Singliar, Denver Dash
SDM
2007
SIAM
73views Data Mining» more  SDM 2007»
15 years 8 months ago
Sketching Landscapes of Page Farms
The Web is a very large social network. It is important and interesting to understand the “ecology” of the Web: the general relations of Web pages to their environment. The un...
Bin Zhou 0002, Jian Pei
SODA
2007
ACM
99views Algorithms» more  SODA 2007»
15 years 8 months ago
Matroids, secretary problems, and online mechanisms
We study a generalization of the classical secretary problem which we call the “matroid secretary problem”. In this problem, the elements of a matroid are presented to an onli...
Moshe Babaioff, Nicole Immorlica, Robert Kleinberg
IADIS
2004
15 years 8 months ago
Research on the Connectivity Coefficients of Internet Topology
The study on the topological structure of the Internet is very important for the simulation and the protocol design of the Internet. In recent years, some researchers have made pr...
Wang Lin, Guanzhong Dai