INFOCOM
2012
IEEE
11 years 7 months ago
2012
IEEE
—Developing simple distributed algorithms to allow nodes to perform topology discovery and message routing using incomplete topological information is a problem of great interest...
CPAIOR
2011
Springer
12 years 8 months ago
2011
Springer
We introduce the Upgrading Shortest Paths Problem, a new combinatorial problem for improving network connectivity with a wide range of applications from multicast communication to ...
IMCSIT
2010
13 years 2 months ago
2010
Abstract--The paper proposes a model which allows integration of services published by independent providers into scientific or business workflows. Optimization algorithms are prop...
IPL
2007
13 years 4 months ago
2007
We study a model that incorporates a budget constraint in a decision making problem. Our goal is to maximize the expected wealth, where in each time period we can either stop the ...
FSTTCS
1993
Springer
13 years 8 months ago
1993
Springer
We investigate the complexity and approximability of some location problems when two distance values are specified for each pair of potential sites. These problems involve the se...
KDD
2006
ACM
14 years 5 months ago
2006
ACM
Classification has been commonly used in many data mining projects in the financial service industry. For instance, to predict collectability of accounts receivable, a binary clas...