Sciweavers

9842 search results - page 1415 / 1969
» The Complexity of the Matching-Cut Problem
Sort
View
BIRTHDAY
2003
Springer
16 years 10 days ago
Comet in Context
Combinatorial optimization problems naturally arise in many application areas, including logistics, manufacturing, supplychain management, and resource allocation. They often give...
Laurent Michel, Pascal Van Hentenryck
ICSE
2003
IEEE-ACM
16 years 10 days ago
Achieving Critical System Survivability Through Software Architectures
Software-intensive systems often exhibit dimensions in size and complexity that exceed the scope of comprehension of even talented, experienced system designers and analysts. With ...
John C. Knight, Elisabeth A. Strunk
IDA
2003
Springer
16 years 9 days ago
Regularization Methods for Additive Models
This paper tackles the problem of model complexity in the context of additive models. Several methods have been proposed to estimate smoothing parameters, as well as to perform var...
Marta Avalos, Yves Grandvalet, Christophe Ambroise
PDP
2002
IEEE
16 years 1 days ago
The CDAG: A Data Structure for Automatic Parallelization for a Multithreaded Architecture
Despite the explosive new interest in Distributed Computing, bringing software — particularly legacy software — to parallel platforms remains a daunting task. The Self Distrib...
Bernd Klauer, Frank Eschmann, Ronald Moore, Klaus ...
WORDS
2002
IEEE
16 years 20 hour ago
Writing Temporally Predictable Code
The Worst-Case Execution-Time Analysis (WCET Analysis) of program code that is to be executed on modern processors is a highly complex task. First, it involves path analysis, to i...
Peter P. Puschner, Alan Burns
« Prev « First page 1415 / 1969 Last » Next »