Sciweavers

3868 search results - page 474 / 774
» Open Systems in TLA
Sort
View
CI
2010
129views more  CI 2010»
15 years 6 months ago
On-Line Case-Based Planning
Some domains, such as real-time strategy (RTS) games, pose several challenges to traditional planning and machine learning techniques. In this paper, we present a novel on-line ca...
Santi Ontañón, Kinshuk Mishra, Neha ...
CLEIEJ
2008
88views more  CLEIEJ 2008»
15 years 6 months ago
A Trust Model for a Group of E-mail Servers
E-mail services are essential in the Internet. However, the current e-mail architecture presents problems that open it to several threats. Alternatives have been proposed to solve...
Leonardo de Oliveira, Carlos Maziero
ECEASST
2008
77views more  ECEASST 2008»
15 years 6 months ago
Using OCL in Executable UML
Executable UML allows precisely describing the software system at level of abstraction. The executable models can be translated to a less programming language completely or execute...
Ke Jiang, Lei Zhang, Shigeru Miyake
AML
2006
106views more  AML 2006»
15 years 6 months ago
Upper bounds on complexity of Frege proofs with limited use of certain schemata
The paper considers a commonly used axiomatization of the classical propositional logic and studies how different axiom schemata in this system contribute to proof complexity of th...
Pavel Naumov
ENTCS
2006
176views more  ENTCS 2006»
15 years 6 months ago
Automatic Formal Synthesis of Hardware from Higher Order Logic
A compiler that automatically translates recursive function definitions in higher order logic to clocked synchronous hardware is described. Compilation is by mechanised proof in t...
Mike Gordon, Juliano Iyoda, Scott Owens, Konrad Sl...