Sciweavers

692 search results - page 36 / 139
» Combinatorics of Partial Derivatives
Sort
View
ACL
1994
14 years 2 days ago
Generalized Chart Algorithm: An Efficient Procedure for Cost-Based Abduction
We present an efficient procedure for cost-based abduction, which is based on the idea of using chart parsers as proof procedures. We discuss in detail three features of our algor...
Yasuharu Den
OL
2011
332views Neural Networks» more  OL 2011»
13 years 5 months ago
A robust implementation of a sequential quadratic programming algorithm with successive error restoration
We consider sequential quadratic programming (SQP) methods for solving constrained nonlinear programming problems. It is generally believed that SQP methods are sensitive to the a...
Klaus Schittkowski
PEPM
1992
ACM
14 years 2 months ago
Self-applicable C Program Specialization
A partial evaluator is an automatic program transformation tool. Given as input a general program and part of its input, it can produce a specialized version. If the partial evalu...
Lars Ole Andersen
STOC
2003
ACM
109views Algorithms» more  STOC 2003»
14 years 11 months ago
Generating random regular graphs
Random regular graphs play a central role in combinatorics and theoretical computer science. In this paper, we analyze a simple algorithm introduced by Steger and Wormald [10] and...
Jeong Han Kim, Van H. Vu
COCOON
2003
Springer
14 years 4 months ago
Fault-Hamiltonicity of Product Graph of Path and Cycle
We investigate hamiltonian properties of Pm × Cn, m ≥ 2 and even n ≥ 4, which is bipartite, in the presence of faulty vertices and/or edges. We show that Pm×Cn with n even is...
Jung-Heum Park, Hee-Chul Kim