Sciweavers

5639 search results - page 935 / 1128
» Timed Abstract Non-interference
Sort
View
CORR
2008
Springer
99views Education» more  CORR 2008»
15 years 3 months ago
The meaning of concurrent programs
system during a single processor cycle. But we can abstract out properties of the sequences and focus on the properties of interest. The "specifications" given here are i...
Victor Yodaiken
CORR
2008
Springer
129views Education» more  CORR 2008»
15 years 3 months ago
Polynomial Linear Programming with Gaussian Belief Propagation
Abstract--Interior-point methods are state-of-the-art algorithms for solving linear programming (LP) problems with polynomial complexity. Specifically, the Karmarkar algorithm typi...
Danny Bickson, Yoav Tock, Ori Shental, Danny Dolev
CORR
2008
Springer
125views Education» more  CORR 2008»
15 years 3 months ago
Semidefinite programming for N-Player Games
Abstract. We introduce two min-max problems: the first problem is to minimize the supremum of finitely many rational functions over a compact basic semi-algebraic set whereas the s...
Rida Laraki, Jean B. Lasserre
127
Voted
CORR
2008
Springer
107views Education» more  CORR 2008»
15 years 3 months ago
Semantics and Evaluation of Top-k Queries in Probabilistic Databases
Abstract. We study here fundamental issues involved in top-k query evaluation in probabilistic databases. We consider simple probabilistic databases in which probabilities are asso...
Xi Zhang, Jan Chomicki
109
Voted
CORR
2008
Springer
86views Education» more  CORR 2008»
15 years 3 months ago
Dynamic System Adaptation by Constraint Orchestration
Abstract. For Paradigm models, evolution is just-in-time specified coordination conducted by a special reusable component McPal. Evolution can be treated consistently and on-the-fl...
Luuk Groenewegen, Erik P. de Vink