2917 search results - page 68 / 584 » Satisfying Interaction Constraints |
RE
2007
Springer
14 years 3 months ago
2007
Springer
Trading-off is a familiar element in requirements practice, but it generally assumes a set of independent requirements competing for resources. Choosing a tram route depends inste...
CODES
2005
IEEE
14 years 2 months ago
2005
IEEE
Sensor network applications face continuously changing environments, which impose varying processing loads on the sensor node. This paper presents an online control method which a...
CEC
2007
IEEE
13 years 9 months ago
2007
IEEE
— Memetic algorithms (MAs) combine the global exploration abilities of evolutionary algorithms with a local search to further improve the solutions. While a neighborhood can be e...
JCSS
2008
13 years 8 months ago
2008
In this paper we derive a generic form of structural decomposition for the constraint satisfaction problem, which we call a guarded decomposition. We show that many existing decom...
ICLP
2010
Springer
14 years 22 days ago
2010
Springer
Interactive Scores is a formalism for the design and performance of interactive scenarios that provides temporal relations (TRs) among the objects of the scenario. We can model TRs...