9626 search results - page 1285 / 1926 » Invariant Based Programming |
147
click to vote
ICALP
2010
Springer
16 years 1 days ago
2010
Springer
Min Ones Constraint Satisfaction Problems, i.e., the task of finding a satisfying assignment with at most k true variables (Min Ones SAT(Γ)), can express a number of interesting ...
194
click to vote
ICALP
2010
Springer
16 years 1 days ago
2010
Springer
Universal Coalgebra provides the notion of a coalgebra as the natural mathematical generalization of state-based evolving systems such as (infinite) words, trees, and transition s...
221
click to vote
LCPC
2009
Springer
15 years 12 months ago
2009
Springer
PC grids represent massive computation capacity at a low cost, but are challenging to employ for parallel computing because of variable and unpredictable performance and availabili...
217
click to vote
ICALP
2001
Springer
15 years 11 months ago
2001
Springer
Abstract. We consider the sequence comparison problem, also known as “hidden pattern” problem, where one searches for a given subsequence in a text (rather than a string unders...
191
click to vote
ICALP
2001
Springer
15 years 11 months ago
2001
Springer
We consider the quantum complexities of the following three problems: searching an ordered list, sorting an un-ordered list, and deciding whether the numbers in a list are all dis...