Pubbl/distr/stampa	[Place of publication not identified], : IEEE Computer Society Press, 2004
Soggetto topico	Engineering & Applied Sciences Computer Science
Formato	Materiale a stampa
Livello bibliografico	Monografia
Lingua di pubblicazione	eng
Record Nr.	UNISA-996214935503316

Pubbl/distr/stampa	[Place of publication not identified], : IEEE Computer Society Press, 2002
Descrizione fisica	1 online resource (xii, 205 pages) : illustrations
Disciplina	511.3
Soggetto topico	Computational Complexity
Formato	Materiale a stampa
Livello bibliografico	Monografia
Lingua di pubblicazione	eng
Nota di contenuto	Preface -- Committees -- Ron Book Prize for Best Student Paper -- 2002 Best Paper Award -- Resolution Lower Bounds for the Weak Pigeonhole Principle -- Hard examples for bounded depth frege -- Resolution lower bounds for the weak pigeon hole principle -- Hard examples for bounded depth Frege -- Improved cryptographic hash functions with worst-case/average-case connection -- Algorithmic derandomization via complexity theory -- Pseudo-random generators for all hardnesses -- Randomness conductors and constant-degree lossless expanders -- Expanders from symmetric codes -- The complexity of approximating the entropy -- Time-space tradeoffs, multiparty communication complexity, and nearest-neighbor problems -- On communication over an entanglement-assisted quantum channel -- Hardness amplification within NP -- 3-MANIFOLD KNOT GENUS is NP-complete -- On the power of unique 2-prover 1-round games -- Learnability beyond AC/sup 0/ -- Resolution lower bounds for perfect matching principles -- Resolution width-size trade-offs for the Pigeon-Hole Principle -- The inapproximability of lattice and coding problems with preprocessing -- Sampling short lattice vectors and the closest lattice vector problem -- The history of complexity -- The correlation between parity and quadratic polynomials mod 3 -- Functions that have read-twice constant width branching programs are not necessarily testable -- On the complexity of integer multiplication in branching programs with multiple tests and in read-once branching programs with limited nondeterminism -- Information theory methods in communication complexity -- Extracting quantum entanglement (general entanglement purification protocols) -- Algebras of minimal rank over perfect fields -- Rapid mixing -- Pseudorandomness and average-case complexity via uniform reductions -- Pseudo-random generators and structure of complete degrees -- Decoding concatenated codes using soft information -- Arthur and Merlin in a quantum world -- Streaming computation of combinatorial objects -- Lower bounds for linear locally decodable codes and private information retrieval -- Better lower bounds for locally decodable codes -- Universal arguments and their applications -- Author index.
Record Nr.	UNISA-996200685103316

Pubbl/distr/stampa	[Place of publication not identified], : IEEE Computer Society Press, 2006
ISBN	1-5090-9472-5
Formato	Materiale a stampa
Livello bibliografico	Monografia
Lingua di pubblicazione	eng
Record Nr.	UNINA-9910145616803321

Pubbl/distr/stampa	[Place of publication not identified], : IEEE Computer Society Press, 1997
Descrizione fisica	1 online resource (x, 321 pages) : illustrations
Disciplina	004.33
Soggetto topico	Real-time data processing
Formato	Materiale a stampa
Livello bibliografico	Monografia
Lingua di pubblicazione	eng
Nota di contenuto	Foreword -- Committees -- Reviewers -- Session 1: Scheduling I -- Bounding Completion Times of Jobs with Arbitrary Release Times and Variable Execution Times -- On Task Schedulability in Real-Time Control System -- A Multiframe Model for Real-Time Tasks -- Session 2 Experimental Systems and Applications -- Middleware for Distributed Industrial Real-Time Systems on ATM Networks -- Analysing APEX Applications -- Operating System Extensions for Dynamic Real-Time Applications -- Session 3: Formal Methods -- Approximate Reachability Analysis of Timed Automata -- Correctness of Vehicle Control Systems -A Case Study -- Reducing the number of clock variables of timed automata -- Predictability of Real-Time Systems: A Process-Algebraic Approach -- Session 4: Synchronization -- A Framework for Implementing Objects and Scheduling Tasks in Lock-Free Real-Time Systems -- Optimizing a FIFO, Scalable Spin Lock Using Consistent Memory -- Work in Progress -- Session S: Invited Talks on System Requirements -- Session 6: Model and Tools -- The MSP.RTL Real-Time Scheduler Synthesis Tool -- Tool Support for the Construction of Statically Analysable Hard Real-Time Ada Systems -- High Availability in The Real-Time Publisher/Subscriber Inter-Process Communication Model -- Session 7: Communications -- Structuring Communication Software for Quality-of-Service Guarantees -- Multirate Scheduling for Guaranteed and Predictive Services in ATM Network -- Message Transmission with Timing Constraints in Ring Networks -- On Supporting Time-Constrained Communications in WDMA-based Star-Coupled Optical Networks -- Session 8: Scheduling II -- Real-Time Queueing Theory -- An Optimal Pinwheel Scheduler Using the Single-Number Reduction Techniqu -- Integrated Scheduling of Multimedia and Hard Real-Time Tasks -- EEE Real-Time Systems TC meeting -- Session 9 Databases -- Commit Processing in Distributed Real-Time Database Systems -- Value-cognizant Admission Control for RTDB Systems -- Scheduling Transactions with Temporal Constraints: Exploiting Data Semantics -- Session 10 Timing Analysis -- Cache Modeling for Real-Time Software: Beyond Direct Mapped Instruction Caches -- Analysis of Cache-related Preemption Delay in Fixed-priority Preemptive Schedulin -- A Method for Bounding the Effect of DMA U0 Interference on Program Execution Time -- Session 11: Resource Allocation and System Implementation -- A Proportional Share Resource Allocation Algorithm for Real-Time, Time-shared Systems -- Visual Assessment of a Real-Time Systems Design: A Case Study on a CNC Controller -- Optimizing Interprocess Communication for Embedded Real-Time Systems -- Author Index.
Record Nr.	UNISA-996204871503316