Sciweavers

1366 search results - page 28 / 274
» Modularizing Contexted Constraints
Sort
View
EPIA
2007
Springer
15 years 5 months ago
GRASPER
In this paper we present GRASPER, a graph constraint solver, based on set constraints. We specify GRASPER’s constraints and we make use of our framework to model a problem in the...
Ruben Duarte Viegas, Francisco Azevedo
CONCUR
2006
Springer
15 years 2 months ago
Minimization, Learning, and Conformance Testing of Boolean Programs
Boolean programs with recursion are convenient abstractions of sequential imperative programs, and can be represented as recursive state machines (RSMs) or pushdown automata. Motiv...
Viraj Kumar, P. Madhusudan, Mahesh Viswanathan
ATAL
2004
Springer
15 years 4 months ago
Flexible Agent Dialogue Strategies and Societal Communication Protocols
We propose an argumentation-based framework for representing communication theories of agents that can take into account dialogue strategies and society protocols in a way that fa...
Antonis C. Kakas, Nicolas Maudet, Pavlos Moraitis
RECONFIG
2008
IEEE
268views VLSI» more  RECONFIG 2008»
15 years 5 months ago
Parametric, Secure and Compact Implementation of RSA on FPGA
1 We present a fast, efficient, and parameterized modular multiplier and a secure exponentiation circuit especially intended for FPGAs on the low end of the price range. The desig...
Ersin Oksuzoglu, Erkay Savas
106
Voted
PERCOM
2010
ACM
14 years 9 months ago
Towards the adaptive integration of multiple context reasoners in pervasive computing environments
Abstract—The pervasive computing vision consists in realizing ubiquitous technologies to support the execution of people’s everyday tasks by proactively providing appropriate i...
Daniele Riboni, Linda Pareschi, Claudio Bettini