Sciweavers

5180 search results - page 246 / 1036
» Concurrency, Time, and Constraints
Sort
View
CONCUR
2007
Springer
15 years 10 months ago
Checking Coverage for Infinite Collections of Timed Scenarios
We consider message sequence charts enriched with timing constraints between pairs of events. As in the untimed setting, an infinite family of time-constrained message sequence cha...
S. Akshay, Madhavan Mukund, K. Narayan Kumar
AAAI
2006
15 years 8 months ago
An Efficient Way of Breaking Value Symmetries
Several methods for breaking value symmetries have been proposed recently in the constraint programming community. They can be used in conjunction with variable symmetry breaking ...
Jean-François Puget
CONSTRAINTS
2008
138views more  CONSTRAINTS 2008»
15 years 6 months ago
Minimization of Locally Defined Submodular Functions by Optimal Soft Arc Consistency
Submodular function minimization is a polynomially-solvable combinatorial problem. Unfortunately the best known general-purpose algorithms have high-order polynomial time complexi...
Martin C. Cooper
MOR
2010
111views more  MOR 2010»
15 years 5 months ago
Generalized Domino-Parity Inequalities for the Symmetric Traveling Salesman Problem
We extend the work of Letchford (2000) by introducing a new class of valid inequalities for the traveling salesman problem, called the generalized domino-parity (GDP) constraints....
William J. Cook, Daniel G. Espinoza, Marcos Goycoo...
DAC
2003
ACM
16 years 7 months ago
Automatic trace analysis for logic of constraints
Verification of system designs continues to be a major challenge today. Simulation remains the primary tool for making sure that implementations perform as they should. We present...
Xi Chen, Harry Hsieh, Felice Balarin, Yosinori Wat...