Sciweavers

2976 search results - page 158 / 596
» On the bounded integer programming
Sort
View
RTAS
2009
IEEE
15 years 9 months ago
Partial Program Admission
Abstract—Real-time systems on non-preemptive platforms require a means of bounding the execution time of programs for admission purposes. Worst-Case Execution Time (WCET) is most...
Michael Wilson, Ron Cytron, Jonathan S. Turner
FSTTCS
2008
Springer
15 years 4 months ago
Analyzing the Implicit Computational Complexity of object-oriented programs
A sup-interpretation is a tool which provides upper bounds on the size of the values computed by the function symbols of a program. Sup-interpretations have shown their interest to...
Jean-Yves Marion, Romain Péchoux
CORR
2007
Springer
47views Education» more  CORR 2007»
15 years 3 months ago
Resource control of object-oriented programs
A sup-interpretation is a tool which provides an upper bound on the size of a value computed by some symbol of a program. Supinterpretations have shown their interest to deal with...
Jean-Yves Marion, Romain Péchoux
CPAIOR
2008
Springer
15 years 4 months ago
Connections in Networks: A Hybrid Approach
This paper extends our previous work by exploring the use of a hybrid solution method for solving the connection subgraph problem. We employ a two phase solution method, which dras...
Carla P. Gomes, Willem Jan van Hoeve, Ashish Sabha...
CPAIOR
2008
Springer
15 years 4 months ago
The Accuracy of Search Heuristics: An Empirical Study on Knapsack Problems
Theoretical models for the evaluation of quickly improving search strategies, like limited discrepancy search, are based on specific assumptions regarding the probability that a va...
Daniel H. Leventhal, Meinolf Sellmann