Sciweavers

3819 search results - page 201 / 764
» Simple Easy Terms
Sort
View
CADE
2004
Springer
16 years 14 days ago
Improved Modular Termination Proofs Using Dependency Pairs
The dependency pair approach is one of the most powerful techniques for automated (innermost) termination proofs of term rewrite systems (TRSs). For any TRS, it generates inequalit...
René Thiemann, Jürgen Giesl, Peter Sch...
ICMI
2004
Springer
120views Biometrics» more  ICMI 2004»
16 years 14 days ago
Support for input adaptability in the ICON toolkit
In this paper, we introduce input adaptability as the ability of an application to exploit alternative sets of input devices effectively and offer users a way of adapting input in...
Pierre Dragicevic, Jean-Daniel Fekete
IH
2004
Springer
16 years 13 days ago
Information Hiding in Finite State Machine
In this paper, we consider how to hide information into finite state machine (FSM), one of the popular computation models. The key advantage of hiding information in FSM is that t...
Lin Yuan, Gang Qu
MIDDLEWARE
2004
Springer
16 years 13 days ago
A hierarchical process execution support for grid computing
Grid is an emerging infrastructure used to share resources among virtual organizations in a seamless manner and to provide breakthrough computing power at low cost. Nowadays there...
Fábio R. L. Cicerre, Edmundo Roberto Mauro ...
PPDP
2004
Springer
16 years 13 days ago
Adventures in interoperability: the SML.NET experience
SML.NET is a compiler for Standard ML that targets the Common Language Runtime and is integrated into the Visual Studio development environment. It supports easy interoperability ...
Nick Benton, Andrew Kennedy, Claudio V. Russo