Sciweavers

1795 search results - page 281 / 359
» On the Complexity of Circuit Satisfiability
Sort
View
ICLP
2004
Springer
14 years 3 months ago
Non-viability Deductions in Arc-Consistency Computation
Arc-Consistency (AC) techniques have been used extensively in the study of Constraint Satisfaction Problems (CSP). These techniques are used to simplify the CSP before or during th...
Camilo Rueda, Frank D. Valencia
JIT
2004
Springer
166views Database» more  JIT 2004»
14 years 3 months ago
Feature-Oriented Development of Software Product Lines: Mapping Feature Models to the Architecture
Software product lines (PLs) present a solid approach in large scale reuse. Due to the PLs’ inherit complexity, many PL methods use the notion of ”features” to support requir...
Periklis Sochos, Ilka Philippow, Matthias Riebisch
WDAG
2004
Springer
144views Algorithms» more  WDAG 2004»
14 years 3 months ago
Contention-Free MAC Protocols for Wireless Sensor Networks
Abstract. A MAC protocol specifies how nodes in a sensor network access a shared communication channel. Desired properties of such MAC protocol are: it should be distributed and c...
Costas Busch, Malik Magdon-Ismail, Fikret Sivrikay...
IEEEAMS
2003
IEEE
14 years 3 months ago
On Conditions for Self-Healing in Distributed Software Systems
This paper attempts to identify one of the necessary conditions for self-healing, or self-repair, in complex systems, and to propose means for satisfying this condition in heterog...
Naftaly H. Minsky
SEFM
2003
IEEE
14 years 3 months ago
From Requirements to Design: Formalizing the Key Steps
Despite the advances in software engineering since 1968, current methods for going from a set of functional requirements to a design are not as direct, repeatable and constructive...
R. Geoff Dromey