29 search results - page 3 / 6 » Exact procedures for solving the discrete ordered median pro... |
DAC
1994
ACM
13 years 10 months ago
1994
ACM
In this paper, we consider the problem of calculating the signal and transition probabilities of the internal nodes of the combinational logic part of a nite state machine (FSM). ...
SODA
2010
ACM
13 years 4 months ago
2010
ACM
We present an exact algorithm that decides, for every fixed r ≥ 2 in time O(m) + 2O(k2 ) whether a given multiset of m clauses of size r admits a truth assignment that satisfi...
AI
2005
Springer
13 years 6 months ago
2005
Springer
Maximum Boolean satisfiability (max-SAT) is the optimization counterpart of Boolean satisfiability (SAT), in which a variable assignment is sought to satisfy the maximum number of...
DSVIS
2003
Springer
13 years 11 months ago
2003
Springer
Based on a revision of the common task understanding in model-based approaches a formal meta model is proposed which allows more expressive task descriptions. A task is considered ...
ATAL
2010
Springer
13 years 7 months ago
2010
Springer
In many multiagent settings, situations arise in which agents must collectively make decisions while not every agent is supposed to have an equal amount of influence in the outcom...