879 search results - page 126 / 176 » A Constraint Programming Approach for the Service Consolidat... |
KBSE
1997
IEEE
14 years 21 days ago
1997
IEEE
In software testing, it is often desirable to find test inputs that exercise specific program features. To find these inputs by hand is extremely time-consuming, especially whe...
RTCSA
2008
IEEE
14 years 2 months ago
2008
IEEE
Nowadays, systems often integrate a variety of applications whose service requirements are heterogeneous. Consequently, systems must be able to concurrently serve applications whi...
ICC
1997
IEEE
14 years 21 days ago
1997
IEEE
This paper takes a known approach for scheduling and admission control in integrated services networks1 , the Priority Token Bank (PTB), whose mechanism and performance have been ...
IFM
2009
Springer
14 years 3 months ago
2009
Springer
We present the new technique of dynamic path reduction (DPR), which allows one to prune redundant paths from the state space of a program under verification. DPR is a very general...
CPAIOR
2008
Springer
13 years 10 months ago
2008
Springer
Abstract. The multiple knapsack problem (MKP) is a classical combinatorial optimization problem. A recent algorithm for some classes of the MKP is bin-completion, a bin-oriented, b...