Sciweavers

127 search results - page 19 / 26
» Some Parameterized Problems On Digraphs
Sort
View
FSTTCS
2006
Springer
15 years 1 months ago
Validity Checking for Finite Automata over Linear Arithmetic Constraints
Abstract Decision procedures underlie many program analysis problems. Traditional program analysis algorithms attempt to prove some property about a single, statically-defined prog...
Gary Wassermann, Zhendong Su
TON
2008
239views more  TON 2008»
14 years 9 months ago
Characterization of failures in an operational IP backbone network
Abstract--As the Internet evolves into a ubiquitous communication infrastructure and supports increasingly important services, its dependability in the presence of various failures...
Athina Markopoulou, Gianluca Iannaccone, Supratik ...
SIAMJO
2000
108views more  SIAMJO 2000»
14 years 9 months ago
Smooth SQP Methods for Mathematical Programs with Nonlinear Complementarity Constraints
Mathematical programs with nonlinear complementarity constraints are reformulated using better-posed but nonsmooth constraints. We introduce a class of functions, parameterized by...
Houyuan Jiang, Daniel Ralph
ISPAN
2002
IEEE
15 years 2 months ago
Automatic Processor Lower Bound Formulas for Array Computations
In the directed acyclic graph (dag) model of algorithms, consider the following problem for precedence-constrained multiprocessor schedules for array computations: Given a sequenc...
Peter R. Cappello, Ömer Egecioglu
WER
1999
Springer
15 years 1 months ago
A Requirements Elicitation Approach Based in Templates and Patterns
One of the main problems of requirements elicitation is expressing customer requirements in a form that can be understood not only by requirements engineers but also by noncomputer...
Amador Durán Toro, B. Bernárdez Jim&...