Sciweavers

Share
WEBI
2010
Springer
8 years 2 months ago
Expertise Matching via Constraint-Based Optimization
Abstract--Expertise matching, aiming to find the alignment between experts and queries, is a common problem in many real applications such as conference paper-reviewer assignment, ...
Wenbin Tang, Jie Tang, Chenhao Tan
CLOUDCOM
2010
Springer
8 years 2 months ago
Cost-Optimal Outsourcing of Applications into the Clouds
Abstract--Commercial services for provisioning software components and virtual infrastructure in the cloud are emerging. For customers, this creates a multitude of possibilities fo...
Immanuel Trummer, Frank Leymann, Ralph Mietzner, W...
TCS
2010
8 years 2 months ago
Active learning in heteroscedastic noise
We consider the problem of actively learning the mean values of distributions associated with a finite number of options. The decision maker can select which option to generate t...
András Antos, Varun Grover, Csaba Szepesv&a...
QUESTA
2010
112views more  QUESTA 2010»
8 years 2 months ago
Admission control for a multi-server queue with abandonment
In a M/M/N+M queue, when there are many customers waiting, it may be preferable to reject a new arrival rather than risk that arrival later abandoning without receiving service. O...
Yasar Levent Koçaga, Amy R. Ward
ALGOSENSORS
2010
Springer
8 years 3 months ago
Lifetime Maximization of Monitoring Sensor Networks
We study the problem of maximizing the lifetime of a sensor network assigned to monitor a given area. Our main result is a linear time dual approximation algorithm that comes arbit...
Peter Sanders, Dennis Schieferdecker
TEC
2002
103views more  TEC 2002»
8 years 4 months ago
A short convergence proof for a class of ant colony optimization algorithms
In this paper, we prove some convergence properties for a class of ant colony optimization algorithms. In particular, we prove that for any small constant 0 and for a sufficiently ...
Thomas Stützle, Marco Dorigo
MP
2002
93views more  MP 2002»
8 years 4 months ago
Conditioning of convex piecewise linear stochastic programs
In this paper we consider stochastic programming problems where the objective function is given as an expected value of a convex piecewise linear random function. With an optimal s...
Alexander Shapiro, Tito Homem-de-Mello, Joocheol K...
COR
2004
291views more  COR 2004»
8 years 4 months ago
Cycling in linear programming problems
We collected and analyzed a number of linear programming problems that have been shown to cycle (not converge) when solved by Dantzig's original simplex algorithm. For these ...
Saul I. Gass, Sasirekha Vinjamuri
TASE
2008
IEEE
8 years 4 months ago
New Hybrid Optimization Algorithms for Machine Scheduling Problems
Dynamic programming, branch-and-bound, and constraint programming are the standard solution principles for nding optimal solutions to machine scheduling problems. We propose a new ...
Yunpeng Pan, Leyuan Shi
ML
2008
ACM
101views Machine Learning» more  ML 2008»
8 years 4 months ago
On reoptimizing multi-class classifiers
Significant changes in the instance distribution or associated cost function of a learning problem require one to reoptimize a previously-learned classifier to work under new cond...
Chris Bourke, Kun Deng, Stephen D. Scott, Robert E...
books