Sciweavers

2796 search results - page 241 / 560
» The coolest path problem
Sort
View
SIAMJO
2008
82views more  SIAMJO 2008»
15 years 6 months ago
Primal-Dual Affine Scaling Interior Point Methods for Linear Complementarity Problems
A first order affine scaling method and two mth order affine scaling methods for solving monotone linear complementarity problems (LCP) are presented. All three methods produce ite...
Florian A. Potra
AIPS
2006
15 years 8 months ago
Looking for Shortcuts: Infeasible Search Analysis for Oversubscribed Scheduling Problems
Searches that include both feasible and infeasible solutions have proved to be efficient algorithms for solving some scheduling problems. Researchers conjecture that these algorit...
Mark F. Rogers, Adele E. Howe, Darrell Whitley
JSW
2008
123views more  JSW 2008»
15 years 6 months ago
Component-oriented Reliability Analysis and Optimal Version-upgrade Problems for Open Source Software
The current software development environment has been changing into new development paradigms such as concurrent distributed development environment and the so-called open source p...
Yoshinobu Tamura, Shigeru Yamada
IJCGA
2008
114views more  IJCGA 2008»
15 years 6 months ago
Fixed Parameter Algorithms for the Minimum Weight Triangulation Problem
Published as Technical Report LU-CS-TR:2005-238 on February 13, 2006, ISSN 1650-1276 Report 158, Lund University, Sweden 2006 We discuss and compare four fixed parameter algorithm...
Magdalene G. Borgelt, Christian Borgelt, Christos ...
DAC
2008
ACM
16 years 7 months ago
Robust chip-level clock tree synthesis for SOC designs
A key problem that arises in System-on-a-Chip (SOC) designs of today is the Chip-level Clock Tree Synthesis (CCTS). CCTS is done by merging all the clock trees belonging to differ...
Anand Rajaram, David Z. Pan