Sciweavers

3082 search results - page 57 / 617
» New Bounds for the Controller Problem
Sort
View
IPPS
2008
IEEE
16 years 12 days ago
Software monitoring with bounded overhead
In this paper, we introduce the new technique of HighConfidence Software Monitoring (HCSM), which allows one to perform software monitoring with bounded overhead and concomitantl...
Sean Callanan, David J. Dean, Michael Gorbovitski,...
FCT
1999
Springer
15 years 10 months ago
Restrictive Acceptance Suffices for Equivalence Problems
One way of suggesting that an NP problem may not be NP-complete is to show that it is in the promise class UP. We propose an analogous new method—weaker in strength of evidence ...
Bernd Borchert, Lane A. Hemaspaandra, Jörg Ro...
HM
2010
Springer
157views Optimization» more  HM 2010»
15 years 7 months ago
Hybrid Heuristics for Dynamic Resource-Constrained Project Scheduling Problem
Dynamic Resource-Constrained Project Scheduling Problem (DRCPSP) is a scheduling problem that works with an uncommon kind of resources: the Dynamic Resources. They increase and dec...
André Renato Villela da Silva, Luiz Satoru ...
CONSTRAINTS
2006
120views more  CONSTRAINTS 2006»
15 years 6 months ago
Constraint Models for the Covering Test Problem
Covering arrays can be applied to the testing of software, hardware and advanced materials, and to the effects of hormone interaction on gene expression. In this paper we develop c...
Brahim Hnich, Steven David Prestwich, Evgeny Selen...
TRANSCI
2010
101views more  TRANSCI 2010»
15 years 4 months ago
Computing Time-Dependent Bid Prices in Network Revenue Management Problems
We propose a new method to compute bid prices in network revenue management problems. The novel aspect of our method is that it naturally provides dynamic bid prices that depend o...
Sumit Kunnumkal, Huseyin Topaloglu