Sciweavers

2917 search results - page 308 / 584
» Satisfying Interaction Constraints
Sort
View
COORDINATION
2004
Springer
16 years 1 days ago
A Lightweight Coordination Middleware for Mobile Computing
This paper presents Limone, a new coordination model that facilitates rapid application development over ad hoc networks consisting of logically mobile agents and physically mobile...
Chien-Liang Fok, Gruia-Catalin Roman, Gregory Hack...
ICST
2010
IEEE
15 years 5 months ago
Automated and Scalable T-wise Test Case Generation Strategies for Software Product Lines
Abstract—Software Product Lines (SPL) are difficult to validate due to combinatorics induced by variability across their features. This leads to combinatorial explosion of the n...
Gilles Perrouin, Sagar Sen, Jacques Klein, Benoit ...
DAC
2002
ACM
16 years 7 months ago
Combining strengths of circuit-based and CNF-based algorithms for a high-performance SAT solver
We propose Satisfiability Checking (SAT) techniques that lead to a consistent performance improvement of up to 3x over state-ofthe-art SAT solvers like Chaff on important problem ...
Malay K. Ganai, Pranav Ashar, Aarti Gupta, Lintao ...
WWW
2007
ACM
16 years 7 months ago
A scalable application placement controller for enterprise data centers
Given a set of machines and a set of Web applications with dynamically changing demands, an online application placement controller decides how many instances to run for each appl...
Chunqiang Tang, Malgorzata Steinder, Mike Spreitze...
AIA
2006
15 years 8 months ago
Speeding Up Model-based Diagnosis by a Heuristic Approach to Solving SAT
Model-based diagnosis of technical systems requires both a simulation machinery and a logic calculus. The former is responsible for the system's behavior analysis, the latter...
Benno Stein, Oliver Niggemann, Theodor Lettmann