Sciweavers

811 search results - page 30 / 163
» When Novelty Is Not Enough
Sort
View
ENTCS
2006
134views more  ENTCS 2006»
13 years 8 months ago
Computing Over-Approximations with Bounded Model Checking
Bounded Model Checking (BMC) searches for counterexamples to a property with a bounded length k. If no such counterexample is found, k is increased. This process terminates when ...
Daniel Kroening
MANSCI
2008
75views more  MANSCI 2008»
13 years 8 months ago
Staffing Multiskill Call Centers via Linear Programming and Simulation
We study an iterative cutting-plane algorithm on an integer program, for minimizing the staffing costs of a multiskill call center subject to service-level requirements which are e...
Mehmet Tolga Çezik, Pierre L'Ecuyer
DA
2010
123views more  DA 2010»
13 years 5 months ago
Paradoxes in Learning and the Marginal Value of Information
We consider the Bayesian ranking and selection problem, in which one wishes to allocate an information collection budget as efficiently as possible to choose the best among severa...
Peter Frazier, Warren B. Powell
DBPL
1999
Springer
102views Database» more  DBPL 1999»
14 years 28 days ago
Union Types for Semistructured Data
Semistructured databases are treated as dynamically typed: they come equipped with no independent schema or type system to constrain the data. Query languages that are designed fo...
Peter Buneman, Benjamin C. Pierce
IWNAS
2008
IEEE
14 years 3 months ago
Parallel Job Scheduling with Overhead: A Benchmark Study
We study parallel job scheduling, where each job may be scheduled on any number of available processors in a given parallel system. We propose a mathematical model to estimate a j...
Richard A. Dutton, Weizhen Mao, Jie Chen, William ...