Info
- Utilizzare la checkbox di selezione a fianco di ciascun documento per attivare le funzionalità di stampa, invio email, download nei formati disponibili del (i) record.
Computational Learning Theory [[electronic resource] ] : Second European Conference, EuroCOLT '95, Barcelona, Spain, March 13 - 15, 1995. Proceedings / / edited by Paul Vitanyi
| Computational Learning Theory [[electronic resource] ] : Second European Conference, EuroCOLT '95, Barcelona, Spain, March 13 - 15, 1995. Proceedings / / edited by Paul Vitanyi |
| Edizione | [1st ed. 1995.] |
| Pubbl/distr/stampa | Berlin, Heidelberg : , : Springer Berlin Heidelberg : , : Imprint : Springer, , 1995 |
| Descrizione fisica | 1 online resource (XVIII, 422 p.) |
| Disciplina | 006.3 |
| Collana | Lecture Notes in Artificial Intelligence |
| Soggetto topico |
Artificial intelligence
Mathematical logic Algorithms Artificial Intelligence Mathematical Logic and Formal Languages Algorithm Analysis and Problem Complexity |
| ISBN | 3-540-49195-3 |
| Formato | Materiale a stampa  |
| Livello bibliografico | Monografia |
| Lingua di pubblicazione | eng |
| Nota di contenuto | The discovery of algorithmic probability: A guide for the programming of true creativity -- A desicion-theoretic generalization of on-line learning and an application to boosting -- Online learning versus offline learning -- Learning distributions by their density levels — A paradigm for learning without a teacher -- Tight worst-case loss bounds for predicting with expert advice -- On-line maximum likelihood prediction with respect to general loss functions -- The power of procrastination in inductive inference: How it depends on used ordinal notations -- Learnability of Kolmogorov-easy circuit expressions via queries -- Trading monotonicity demands versus mind changes -- Learning recursive functions from approximations -- On the intrinsic complexity of learning -- The structure of intrinsic complexity of learning -- Kolmogorov numberings and minimal identification -- Stochastic complexity in learning -- Function learning from interpolation (extended abstract) -- Approximation and learning of convex superpositions -- Minimum description length estimators under the optimal coding scheme -- MDL learning of unions of simple pattern languages from positive examples -- A note on the use of probabilities by mechanical learners -- Characterizing rational versus exponential learning curves -- Is pocket algorithm optimal? -- Some theorems concerning the free energy of (Un) constrained stochastic Hopfield neural networks -- A space-bounded learning algorithm for axis-parallel rectangles -- Learning decision lists and trees with equivalence-queries -- Bounding VC-dimension for neural networks: Progress and prospects -- Average case analysis of a learning algorithm for ?-DNF expressions -- Learning by extended statistical queries and its relation to PAC learning -- Typed pattern languages and their learnability -- Learning behaviors of automata from shortest counterexamples -- Learning of regular expressions by pattern matching -- The query complexity of learning some subclasses of context-free grammars. |
| Record Nr. | UNISA-996466125403316 |
| Berlin, Heidelberg : , : Springer Berlin Heidelberg : , : Imprint : Springer, , 1995 | ||
| Materiale a stampa | ||
| Lo trovi qui: Univ. di Salerno | ||
| ||
Distributed Algorithms [[electronic resource] ] : 8th International Workshop, WDAG 1994, Terschelling, The Netherlands, September 29 - October 1, 1994. Proceedings / / edited by Gerard Tel, Paul Vitanyi
| Distributed Algorithms [[electronic resource] ] : 8th International Workshop, WDAG 1994, Terschelling, The Netherlands, September 29 - October 1, 1994. Proceedings / / edited by Gerard Tel, Paul Vitanyi |
| Edizione | [1st ed. 1994.] |
| Pubbl/distr/stampa | Berlin, Heidelberg : , : Springer Berlin Heidelberg : , : Imprint : Springer, , 1994 |
| Descrizione fisica | 1 online resource (X, 378 p.) |
| Disciplina | 004/.36 |
| Collana | Lecture Notes in Computer Science |
| Soggetto topico |
Computers
Software engineering Computer programming Algorithms Computer communication systems Theory of Computation Software Engineering/Programming and Operating Systems Computation by Abstract Devices Programming Techniques Algorithm Analysis and Problem Complexity Computer Communication Networks |
| ISBN | 3-540-48799-9 |
| Formato | Materiale a stampa |
| Livello bibliografico | Monografia |
| Lingua di pubblicazione | eng |
| Nota di contenuto | Replicated file management in large-scale distributed systems -- Realization of PRAMs: Processor design -- Factoring -- Primary partition “Virtually-synchronous communication” harder than consensus -- Secure distributed computing: Theory and practice -- Fast increment registers -- Coping with contention -- Exotic behaviour of consensus numbers -- Space-optimum conflict-free construction of 1-writer 1-reader multivalued atomic variable -- Linear-time snapshot using multi-writer multi-reader registers -- Fast, long-lived renaming -- Anomalies in the wait-free hierarchy -- Finding the extrema of a distributed multiset -- The level of handshake required for establishing a connection -- Local labeling and resource allocation using preprocessing -- A scalable approach to routing in ATM networks -- Low complexity network synchronization -- An incremental distributed algorithm for computing biconnected components -- Reaching (and maintaining) agreement in the presence of mobile faults -- Uniform deterministic self-stabilizing ring-orientation on odd-length rings -- Using failure detectors to solve consensus in asynchronous shared-memory systems -- An algorithm with optimal failure locality for the dining philosophers problem -- Average and randomized complexity of distributed problems -- Self-stabilization by local checking and global reset -- Breakpoints and time in distributed computations -- Cheaper matrix clocks. |
| Record Nr. | UNISA-996466132103316 |
| Berlin, Heidelberg : , : Springer Berlin Heidelberg : , : Imprint : Springer, , 1994 | ||
| Materiale a stampa | ||
| Lo trovi qui: Univ. di Salerno | ||
| ||