86 search results - page 13 / 18 » Satisfiability Algorithms and Finite Quantification |
CORR
2006
Springer
14 years 9 months ago
2006
Springer
Abstract--In wireless networks, important network functionalities such as power control, rate allocation, routing, and congestion control must be optimized in a coherent and integr...
CADE
2006
Springer
15 years 9 months ago
2006
Springer
Abstract. Verification by network invariants is a heuristic to solve uniform verification of parameterized systems. Given a system P, a network invariant for P is that abstracts th...
107
click to vote
RTAS
2005
IEEE
15 years 3 months ago
2005
IEEE
Feedback control real-time scheduling (FCS) aims at satisfying performance specifications of real-time systems based on adaptive resource management. Existing FCS algorithms often...
85
Voted
NIPS
2004
14 years 10 months ago
2004
An important aspect of clustering algorithms is whether the partitions constructed on finite samples converge to a useful clustering of the whole data space as the sample size inc...
ICGI
2010
Springer
14 years 7 months ago
2010
Springer
Abstract. We present an exact algorithm for identification of deterministic finite automata (DFA) which is based on satisfiability (SAT) solvers. Despite the size of the low level ...