Sciweavers

265 search results - page 31 / 53
» Perceptual Reasoning: A New Computing with Words Engine
Sort
View
ECAI
2000
Springer
13 years 12 months ago
Search Pruning Conditions for Boolean Optimization
This paper proposes new algorithms for the Binate Covering Problem (BCP), a well-known restriction of Boolean Optimization. Binate Covering finds application in many areas of Com...
Vasco M. Manquinho, João P. Marques Silva
AMAI
2000
Springer
13 years 11 months ago
On Solving Boolean Optimization with Satisfiability-Based Algorithms
This paper proposes new algorithms for the Binate Covering Problem (BCP), a well-known restriction of Boolean Optimization. Binate Covering finds application in many areas of Comp...
Vasco M. Manquinho, João P. Marques Silva
FSEN
2007
Springer
14 years 1 months ago
Formalizing Compatibility and Substitutability in Communication Protocols Using I/O-Constraint Automata
Abstract. A communication protocol consists of a sequence of messages used by peer entities to communicate. Each entity in a network is equipped by at least one protocol stack. Due...
Mahdi Niamanesh, Rasool Jalili
VAMOS
2007
Springer
14 years 1 months ago
Layered design approach for context-aware systems
The omnipresent integration of computer technology in everyday applications introduces new opportunities to make software systems aware of the context in which they are used. Such...
Brecht Desmet, Jorge Vallejos, Pascal Costanza, Ro...
FOSSACS
2004
Springer
14 years 27 days ago
Probabilistic Bisimulation and Equivalence for Security Analysis of Network Protocols
Abstract. Using a probabilistic polynomial-time process calculus designed for specifying security properties as observational equivalences, we develop a form of bisimulation that j...
Ajith Ramanathan, John C. Mitchell, Andre Scedrov,...