Sciweavers

658 search results - page 8 / 132
» Partially Ordered Constraint Optimization Problems
Sort
View
DAGSTUHL
2008
13 years 8 months ago
Uniprocessor EDF Feasibility is an Integer Problem
The research on real-time scheduling has mostly focused on the development of algorithms that allows to test whether the constraints imposed on the task execution (often expressed ...
Enrico Bini
EPS
1998
Springer
13 years 11 months ago
Evolutionary Search for Minimal Elements in Partially Ordered Finite Sets
The task of finding minimal elements of a partially ordered set is a generalization of the task of finding the global minimum of a real-valued function or of finding Pareto-optimal...
Günter Rudolph
ATAL
2005
Springer
14 years 28 days ago
Impact of problem centralization in distributed constraint optimization algorithms
Recent progress in Distributed Constraint Optimization Problems (DCOP) has led to a range of algorithms now available which differ in their amount of problem centralization. Probl...
John Davin, Pragnesh Jay Modi
COCOA
2007
Springer
14 years 1 months ago
On Threshold BDDs and the Optimal Variable Ordering Problem
Abstract. Many combinatorial optimization problems can be formulated as 0/1 integer programs (0/1 IPs). The investigation of the structure of these problems raises the following ta...
Markus Behle
TACAS
2010
Springer
342views Algorithms» more  TACAS 2010»
14 years 2 months ago
SAT Based Bounded Model Checking with Partial Order Semantics for Timed Automata
We study the model checking problem of timed automata based on SAT solving. Our work investigates alternative possibilities for coding the SAT reductions that are based on parallel...
Janusz Malinowski, Peter Niebert