Sciweavers

2861 search results - page 383 / 573
» Constraint Programming
Sort
View
138
Voted
CPAIOR
2008
Springer
15 years 4 months ago
The Accuracy of Search Heuristics: An Empirical Study on Knapsack Problems
Theoretical models for the evaluation of quickly improving search strategies, like limited discrepancy search, are based on specific assumptions regarding the probability that a va...
Daniel H. Leventhal, Meinolf Sellmann
FM
2009
Springer
95views Formal Methods» more  FM 2009»
15 years 7 months ago
On the Complexity of Synthesizing Relaxed and Graceful Bounded-Time 2-Phase Recovery
The problem of enforcing bounded-time 2-phase recovery in real-time programs is often necessitated by conflict between faulttolerance requirements and timing constraints. In this ...
Borzoo Bonakdarpour, Sandeep S. Kulkarni
140
Voted
ICSE
2011
IEEE-ACM
14 years 6 months ago
Leveraging software architectures to guide and verify the development of sense/compute/control applications
A software architecture describes the structure of a computing system by specifying software components and their interactions. Mapping a software architecture to an implementatio...
Damien Cassou, Emilie Balland, Charles Consel, Jul...
CPAIOR
2004
Springer
15 years 8 months ago
Models and Symmetry Breaking for 'Peaceable Armies of Queens'
We discuss a di cult optimization problem on a chess-board, requiring equal numbers of black and white queens to be placed on the board so that the white queens cannot attack the b...
Barbara M. Smith, Karen E. Petrie, Ian P. Gent
ECAI
2008
Springer
15 years 4 months ago
A BDD Approach to the Feature Subscription Problem
Modern feature-rich telecommunications services offer significant opportunities to human users. To make these services more usable, facilitating personalisation is very important s...
Tarik Hadzic, David Lesaint, Deepak Mehta, Barry O...