Sciweavers

1241 search results - page 98 / 249
» Path-oriented random testing
Sort
View
EOR
2010
145views more  EOR 2010»
15 years 4 months ago
Robust and data-driven approaches to call centers
We propose both robust and data-driven approaches to a fluid model of call centers that incorporates random arrival rates with abandonment to determine staff levels and dynamic ro...
Dimitris Bertsimas, Xuan Vinh Doan
JSAT
2006
119views more  JSAT 2006»
15 years 4 months ago
A Faster Clause-Shortening Algorithm for SAT with No Restriction on Clause Length
We give a randomized algorithm for testing satisfiability of Boolean formulas in conjunctive normal form with no restriction on clause length. This algorithm uses the clauseshorte...
Evgeny Dantsin, Alexander Wolpert
ANOR
2002
110views more  ANOR 2002»
15 years 4 months ago
Tabu Search with Simple Ejection Chains for Coloring Graphs
We present a Tabu Search (TS) method that employs a simple version of ejection chains for coloring graphs. The procedure is tested on a set of benchmark problems. Empirical result...
José Luis González Velarde, Manuel L...
CN
2000
92views more  CN 2000»
15 years 4 months ago
What is this page known for? Computing Web page reputations
The textual content of the Web enriched with the hyperlink structure surrounding it can be a useful source of information for querying and searching. This paper presents a search ...
Davood Rafiei, Alberto O. Mendelzon
ATS
2009
IEEE
113views Hardware» more  ATS 2009»
15 years 11 months ago
Deterministic Algorithms for ATPG under Leakage Constraints
—Measuring the steady state leakage current (IDDQ) is very successful in detecting faults not discovered by standard fault models. But vector dependencies of IDDQ decrease the re...
Gorschwin Fey