257 search results - page 25 / 52 » A (Somewhat) New Solution to the Variable Binding Problem |
83
Voted
CORR
2002
Springer
14 years 9 months ago
2002
Springer
: We study the satisfiability of randomly generated formulas formed by M clauses of exactly K literals over N Boolean variables. For a given value of N the problem is known to be m...
ERCIMDL
2009
Springer
15 years 4 months ago
2009
Springer
We consider the problem of e-Infrastructures that wish to reconcile the generality of their services with the bespoke requirements of diverse user communities. We motivate the requ...
NETWORKING
2000
14 years 11 months ago
2000
Abstract. The design of survivable mesh based STM networks has received considerable attention in recent years and is a complex multiconstraint optimization problem. In this paper,...
JMLR
2006
14 years 9 months ago
2006
Support vector machines are trained by solving constrained quadratic optimization problems. This is usually done with an iterative decomposition algorithm operating on a small wor...
AINA
2004
IEEE
15 years 1 months ago
2004
IEEE
Unlike host mobility support, network mobility is concerned with situations where an entire network changes its point of attachment to the Internet. Furthermore, we should conside...