Sciweavers

5214 search results - page 301 / 1043
» The Online Specialization Problem
Sort
View
176
Voted
FMCO
2006
Springer
107views Formal Methods» more  FMCO 2006»
15 years 10 months ago
Learning Meets Verification
In this paper, we give an overview on some algorithms for learning automata. Starting with Biermann's and Angluin's algorithms, we describe some of the extensions caterin...
Martin Leucker
FOSSACS
2006
Springer
15 years 10 months ago
Parity Games Played on Transition Graphs of One-Counter Processes
We consider parity games played on special pushdown graphs, namely those generated by one-counter processes. For parity games on pushdown graphs, it is known from [22] that decidin...
Olivier Serre
FCS
2006
15 years 8 months ago
A Theoretical Study of Parallel Voronoi Diagram
In this paper, we concentrate on the problem of computing a Voronoi diagram using Hypercube model of computation. The main contribution of this work is the O(log3 n) parallel algor...
Rashid Muhammad
EJC
2008
15 years 6 months ago
Some existence and construction results of polygonal designs
This paper revisits the existence and construction problems for polygonal designs (a special class of partially balanced incomplete block designs associated with regular polygons)...
Gargi Bhattacharyya, John Hegeman, Joohyung Kim, J...
CORR
2006
Springer
79views Education» more  CORR 2006»
15 years 6 months ago
Feedback Capacity of Stationary Gaussian Channels
Abstract-- The feedback capacity of additive stationary Gaussian noise channels is characterized as the solution to a variational problem. Toward this end, it is proved that the op...
Young-Han Kim