3663 search results - page 369 / 733 » Problems in the ontology of computer programs |
173
click to vote
PDPTA
2004
15 years 8 months ago
2004
Abstract One of the goals envisioned by Grid computing is to make the execution of both computational and data-intensive problems possible. A key problem is finding the optimal set...
155
click to vote
EOR
2000
15 years 6 months ago
2000
We consider the single itemcapacitated lot{sizingproblem, a well-known productionplanningmodelthat often arises in practical applications, and derive new classes of valid inequali...
176
click to vote
MFCS
2010
Springer
15 years 5 months ago
2010
Springer
Karchmer, Kushilevitz and Nisan formulated the formula size problem as an integer programming problem called the rectangle bound and introduced a technique called the LP bound, whi...
194
click to vote
WIOPT
2010
IEEE
15 years 4 months ago
2010
IEEE
We consider the resource allocation (RA) problem of maximizing the weighted sum of the minimal user rates (WSMR) of coordinated cells subject to a total power constraint at each ba...
225
click to vote
CONCUR
2011
Springer
14 years 6 months ago
2011
Springer
Abstract. In 2004, Berdine, Calcagno and O’Hearn introduced a fragment of separation logic that allows for reasoning about programs with pointers and linked lists. They showed th...