Sciweavers

4403 search results - page 190 / 881
» Galois Theory of Algorithms
Sort
View
CAV
2012
Springer
227views Hardware» more  CAV 2012»
13 years 9 months ago
Minimum Satisfying Assignments for SMT
Abstract. A minimum satisfying assignment of a formula is a minimumcost partial assignment of values to the variables in the formula that guarantees the formula is true. Minimum sa...
Isil Dillig, Thomas Dillig, Kenneth L. McMillan, A...
DIALM
2000
ACM
112views Algorithms» more  DIALM 2000»
15 years 10 months ago
A decision-theoretic approach to resource allocation in wireless multimedia networks
The allocation of scarce spectral resources to support as many user applications as possible while maintaining reasonable quality of service is a fundamental problem in wireless c...
Zygmunt J. Haas, Joseph Y. Halpern, Erran L. Li, S...
COCO
2000
Springer
112views Algorithms» more  COCO 2000»
15 years 10 months ago
Combinatorial Interpretation of Kolmogorov Complexity
Kolmogorov’s very first paper on algorithmic information theory (Kolmogorov, Problemy peredachi infotmatsii 1(1) (1965), 3) was entitled “Three approaches to the definition ...
Andrei E. Romashchenko, Alexander Shen, Nikolai K....
ATAL
2011
Springer
14 years 6 months ago
Solving Stackelberg games with uncertain observability
Recent applications of game theory in security domains use algorithms to solve a Stackelberg model, in which one player (the leader) first commits to a mixed strategy and then th...
Dmytro Korzhyk, Vincent Conitzer, Ronald Parr
SCALESPACE
2005
Springer
15 years 12 months ago
Stability of Top-Points in Scale Space
This paper presents an algorithm for computing stability of top-points in scale-space. The potential usefulness of top-points in scalespace has already been shown for a number of a...
Evguenia Balmachnova, Luc Florack, Bram Platel, Fr...