5214 search results - page 115 / 1043 » The Online Specialization Problem |
153
Voted
WALCOM
2007
IEEE
15 years 4 months ago
2007
IEEE
Due to the recent growth in the demand of mobile communication services in several typical environments, the development of efficient systems for providing specialized services ha...
143
Voted
CORR
2011
Springer
14 years 10 months ago
2011
Springer
In this paper, we consider approximability issues of the following four problems: triangle packing, full sibling reconstruction, maximum profit coverage and 2-coverage. All of th...
142
Voted
DAC
2006
ACM
15 years 9 months ago
2006
ACM
This article describes a new software-based on-line memory compression algorithm for embedded systems and presents a method of adaptively managing the uncompressed and compressed ...
155
Voted
COLT
2000
Springer
15 years 8 months ago
2000
Springer
We describe a novel family of PAC model algorithms for learning linear threshold functions. The new algorithms work by boosting a simple weak learner and exhibit complexity bounds...
136
Voted
COR
2011
14 years 10 months ago
2011
In this paper we make a comparative study of several mixed integer linear programming (MILP) formulations for resource-constrained project scheduling problems (RCPSPs). First, we ...