Sciweavers

1763 search results - page 231 / 353
» A Formalization of Polytime Functions
Sort
View
LPAR
2007
Springer
15 years 4 months ago
Deciding Knowledge in Security Protocols for Monoidal Equational Theories
Abstract. In formal approaches, messages sent over a network are usually modeled by terms together with an equational theory, axiomatizing the properties of the cryptographic funct...
Véronique Cortier, Stéphanie Delaune
PPDP
2007
Springer
15 years 4 months ago
A simple rewrite notion for call-time choice semantics
Non-confluent and non-terminating rewrite systems are interesting from the point of view of programming. In particular, existing functional logic languages use such kind of rewri...
Francisco Javier López-Fraguas, Juan Rodr&i...
WIOPT
2006
IEEE
15 years 4 months ago
Online association policies in IEEE 802.11 WLANs
Abstract— In this paper, we study the performance of clientAccess Point (AP) association policies in IEEE 802.11 based WLANs. In many scenarios, clients have a choice of APs with...
Gaurav Kasbekar, Joy Kuri, Pavan Nuggehalli
DATE
2005
IEEE
102views Hardware» more  DATE 2005»
15 years 3 months ago
Modeling of a Reconfigurable OFDM IP Block Family For an RF System Simulator
The idea of design domain specific Mother Model of IP block family as a base of modeling of system integration is presented here. A common reconfigurable Mother Model for ten diff...
Hannu Heusala, Jussi Liedes
KCAP
2005
ACM
15 years 3 months ago
An Approach to Ontology Mapping Negotiation
Ontology mapping negotiation aims to achieve consensus among real-world entities about the process of transforming information between different models (ontologies). This paper de...
Nuno Silva, Paulo Maio, João Rocha