8132 search results - page 1214 / 1627 » Dependability, Abstraction, and Programming |
181
Voted
ATAL
2010
Springer
15 years 8 months ago
2010
Springer
Service coordination in domains involving temporal constraints and duration uncertainty has previously been solved with a greedy algorithm that attempts to satisfy service requests...
173
click to vote
ATVA
2010
Springer
15 years 8 months ago
2010
Springer
Abstract. We present a first-order theory of (finite) sequences with integer elements, Presburger arithmetic, and regularity constraints, which can model significant properties of ...
215
click to vote
CADE
2010
Springer
15 years 8 months ago
2010
Springer
Abstract. We describe mcmt, a fully declarative and deductive symbolic model checker for safety properties of infinite state systems whose state variables are arrays. Theories spec...
173
click to vote
CPAIOR
2009
Springer
15 years 8 months ago
2009
Springer
Abstract. In scheduling using constraint programming we usually reason only about possible start times and end times of activities and remove those which are recognized as unfeasib...
184
click to vote
GECCO
2008
Springer
15 years 8 months ago
2008
Springer
This paper presents a variant of Quantum behaved Particle Swarm Optimization (QPSO) named Q-QPSO for solving global optimization problems. The Q-QPSO algorithm is based on the cha...