Sciweavers

16504 search results - page 138 / 3301
» New Problems, New Solutions
Sort
View
SIAMJO
2002
115views more  SIAMJO 2002»
15 years 6 months ago
Superlinearly Convergent Algorithms for Solving Singular Equations and Smooth Reformulations of Complementarity Problems
We propose a new algorithm for solving smooth nonlinear equations in the case where their solutions can be singular. Compared to other techniques for computing singular solutions, ...
Alexey F. Izmailov, Mikhail V. Solodov
ECAI
2008
Springer
15 years 8 months ago
A New Approach to Planning in Networks
Control of networks like those for transportation, power distribution, communication to name a few, provides challenges to planning and scheduling. Many problems can be defined in ...
Jussi Rintanen
IAJIT
2008
223views more  IAJIT 2008»
15 years 6 months ago
A New Exam Scheduling Algorithm Using Graph Coloring
: This paper presents a graph-coloring-based algorithm for the exam scheduling application, with the objective of achieving fairness, accuracy, and optimal exam time period. Throug...
Mohammad Malkawi, Mohammad Al-Haj Hassan, Osama Al...
DAM
2006
63views more  DAM 2006»
15 years 6 months ago
A new family of proximity graphs: Class cover catch digraphs
Motivated by issues in machine learning and statistical pattern classification, we investigate a class cover problem (CCP) with an associated family of directed graphs--class cove...
Jason DeVinney, Carey E. Priebe
POPL
2003
ACM
16 years 6 months ago
New results on the computability and complexity of points - to analysis
Given a program and two variables p and q, the goal of points-to analysis is to check if p can point to q in some execution of the program. This well-studied problem plays a cruci...
Venkatesan T. Chakaravarthy