2362 search results - page 427 / 473 » Programming in Standard ML |
118
click to vote
ICALP
2010
Springer
15 years 1 months ago
2010
Springer
We study bargaining games between suppliers and manufacturers in a network context. Agents wish to enter into contracts in order to generate surplus which then must be divided amon...
120
click to vote
DLS
2005
15 years 1 months ago
2005
The DDP (Demand-driven/Pruning) analysis algorithm allows us to perform data-flow analyses of programming languages that are dynamically typed and have higher-order control flow...
ESOP
2008
Springer
15 years 1 months ago
2008
Springer
In an optimistic approach to security, one can often simplify protocol design by relying on audit logs, which can be analyzed a posteriori. Such auditing is widely used in practice...
111
click to vote
APPROX
2010
Springer
15 years 1 months ago
2010
Springer
We consider optimization problems that can be formulated as minimizing the cost of a feasible solution wT x over an arbitrary combinatorial feasible set F {0, 1}n . For these pro...
107
click to vote
ESANN
2004
15 years 1 months ago
2004
This paper is based on a new way for determining the regularization trade-off in least squares support vector machines (LS-SVMs) via a mechanism of additive regularization which ha...