1274 search results - page 95 / 255 » N-fold integer programming |
110
click to vote
RTSS
1999
IEEE
15 years 6 months ago
1999
IEEE
The problem of maximizing system utility by allocating a single finite resource to satisfy discrete Quality of Service (QoS) requirements of multiple applications along multiple Q...
119
click to vote
IH
2007
Springer
15 years 8 months ago
2007
Springer
Abstract. We introduce software integrity checking expressions (SoftICEs), which are program predicates that can be used in software tamper detection. We present two candidates, pr...
99
Voted
CP
2003
Springer
15 years 7 months ago
2003
Springer
Abstract. The Quasigroup Completion Problem (QCP) is a very challenging benchmark among combinatorial problems, and the focus of much recent interest in the area of constraint prog...
107
Voted
IOR
2008
15 years 2 months ago
2008
In 1958, Wagner and Whitin published a seminal paper on the deterministic uncapacitated lot-sizing problem, a fundamental model that is embedded in many practical production plann...
112
Voted
IWMM
2009
Springer
15 years 9 months ago
2009
Springer
Magpie is a source-to-source transformation for C programs that enables precise garbage collection, where precise means that integers are not confused with pointers, and the liven...