Sciweavers

2436 search results - page 176 / 488
» Comonadic Notions of Computation
Sort
View
JUCS
2008
151views more  JUCS 2008»
15 years 4 months ago
The Bit-Complexity of Finding Nearly Optimal Quadrature Rules for Weighted Integration
: Given a probability measure and a positive integer n. How to choose n knots and n weights such that the corresponding quadrature rule has the minimum worst-case error when appli...
Volker Bosserhoff
ENTCS
2007
111views more  ENTCS 2007»
15 years 4 months ago
Reversibility and Models for Concurrency
There is a growing interest in models of reversible computation driven by exciting application areas such as bio-systems and quantum computing. Reversible process algebras RCCS [2...
Iain Phillips, Irek Ulidowski
140
Voted
MFCS
2010
Springer
15 years 3 months ago
Information Complexity of Online Problems
Abstract. What is information? Frequently spoken about in many contexts, yet nobody has ever been able to define it with mathematical rigor. The best we are left with so far is th...
Juraj Hromkovic, Rastislav Královic, Richar...
MOBICOM
2012
ACM
13 years 7 months ago
Temporal reachability graphs
While a natural fit for modeling and understanding mobile networks, time-varying graphs remain poorly understood. Indeed, many of the usual concepts of static graphs have no obvi...
John Whitbeck, Marcelo Dias de Amorim, Vania Conan...
BIRTHDAY
2006
Springer
15 years 8 months ago
Some Varieties of Equational Logic
d Abstract) Gordon Plotkin1, LFCS, School of Informatics, University of Edinburgh, UK. The application of ideas from universal algebra to computer science has long been a major the...
Gordon D. Plotkin