Sciweavers

14649 search results - page 188 / 2930
» Principles of problem solving
Sort
View
DM
2006
128views more  DM 2006»
15 years 6 months ago
Non-trivial t-designs without repeated blocks exist for all t
A computer package is being developed at Bayreuth for the generation and investigation of discrete structures. The package is a C and C++ class library of powerful algorithms endow...
Luc Teirlinck
NIPS
1996
15 years 7 months ago
Solving the Ill-Conditioning in Neural Network Learning
Abstract. In this paper we investigate the feed-forward learning problem. The well-known ill-conditioning which is present in most feed-forward learning problems is shown to be the...
P. Patrick van der Smagt, Gerd Hirzinger
MOR
2002
94views more  MOR 2002»
15 years 6 months ago
The Complexity of Generic Primal Algorithms for Solving General Integer Programs
ngly better objective function value until an optimal solution is reached. From an abstract point of view, an augmentation problem is solved in each iteration. That is, given a fea...
Andreas S. Schulz, Robert Weismantel
CCS
2001
ACM
15 years 10 months ago
Constraint solving for bounded-process cryptographic protocol analysis
The reachability problem for cryptographic protocols with nonatomic keys can be solved via a simple constraint satisfaction procedure.
Jonathan K. Millen, Vitaly Shmatikov
GECCO
2004
Springer
118views Optimization» more  GECCO 2004»
15 years 11 months ago
Adapting Representation in Genetic Programming
Genetic Programming uses trees to represent chromosomes. The user defines the representation space by defining the set of functions and terminals to label the nodes in the trees....
Cezary Z. Janikow