Sciweavers

8228 search results - page 155 / 1646
» Structural Logical Relations
Sort
View
JLP
2010
142views more  JLP 2010»
13 years 5 months ago
Relational bytecode correlations
We present a calculus for tracking equality relationships between values through pairs of bytecode programs. The calculus may serve as a certification mechanism for noninterferenc...
Lennart Beringer
JMLR
2012
12 years 25 days ago
Hierarchical Relative Entropy Policy Search
Many real-world problems are inherently hierarchically structured. The use of this structure in an agent’s policy may well be the key to improved scalability and higher performa...
Christian Daniel, Gerhard Neumann, Jan Peters
APAL
2006
76views more  APAL 2006»
13 years 10 months ago
Non-primitive recursive decidability of products of modal logics with expanding domains
We show that--unlike products of `transitive' modal logics which are usually undecidable-their `expanding domain' relativisations can be decidable, though not in primiti...
David Gabelaia, Agi Kurucz, Frank Wolter, Michael ...
STOC
2004
ACM
153views Algorithms» more  STOC 2004»
14 years 10 months ago
Quantum and classical query complexities of local search are polynomially related
Let f be an integer valued function on a finite set V . We call an undirected graph G(V, E) a neighborhood structure for f. The problem of finding a local minimum for f can be phr...
Miklos Santha, Mario Szegedy
KES
2007
Springer
14 years 4 months ago
Spreadsheet Interface Which Simplifies the Visualization of the Network Structures
We developed a system that extracts and visualizes the network structures from relational data on spreadsheets. Visualization through network diagrams obtained from relational data...
Satoshi Koike, Kazuo Misue, Jiro Tanaka