Sciweavers

1298 search results - page 114 / 260
» The online set cover problem
Sort
View
SIGECOM
2004
ACM
96views ECommerce» more  SIGECOM 2004»
15 years 12 months ago
A stochastic programming approach to scheduling in TAC SCM
In this paper, we combine two approaches to handling uncertainty: we use techniques for finding optimal solutions in the expected sense to solve combinatorial optimization proble...
Michael Benisch, Amy R. Greenwald, Victor Narodits...
VSTTE
2012
Springer
14 years 2 months ago
Infeasible Code Detection
A piece of code in a computer program is infeasible if it cannot be part of any normally-terminating execution of the program. We develop an algorithm for the automatic detection o...
Cristiano Bertolini, Martin Schäf, Pascal Sch...
ICSE
2012
IEEE-ACM
13 years 8 months ago
Industrial application of concolic testing approach: A case study on libexif by using CREST-BV and KLEE
—As smartphones become popular, manufacturers such as Samsung Electronics are developing smartphones with rich functionality such as a camera and photo editing quickly, which acc...
Yunho Kim, Moonzoo Kim, Young Joo Kim, Yoonkyu Jan...
GECCO
2007
Springer
149views Optimization» more  GECCO 2007»
16 years 19 days ago
Optimal antenna placement using a new multi-objective chc algorithm
Radio network design (RND) is a fundamental problem in cellular networks for telecommunications. In these networks, the terrain must be covered by a set of base stations (or anten...
Antonio J. Nebro, Enrique Alba, Guillermo Molina, ...
ANOR
2010
130views more  ANOR 2010»
15 years 3 months ago
Greedy scheduling with custom-made objectives
We present a methodology to automatically generate an online job scheduling method for a custom-made objective and real workloads. The scheduling problem comprises independent para...
Carsten Franke, Joachim Lepping, Uwe Schwiegelshoh...