Sciweavers

434 search results - page 52 / 87
» Monadic Bounded Algebras
Sort
View
CONSTRAINTS
2007
83views more  CONSTRAINTS 2007»
13 years 10 months ago
Generic Incremental Algorithms for Local Search
When a new (global) constraint is introduced in local search, measures for the penalty and variable conflicts of that constraint must be defined, and incremental algorithms for m...
Magnus Ågren, Pierre Flener, Justin Pearson
RP
2010
Springer
146views Control Systems» more  RP 2010»
13 years 8 months ago
Depth Boundedness in Multiset Rewriting Systems with Name Binding
Abstract. In this paper we consider ν-MSR, a formalism that combines the two main existing approaches for multiset rewriting, namely MSR and CMRS. In ν-MSR we rewrite multisets o...
Fernando Rosa Velardo
STOC
1989
ACM
96views Algorithms» more  STOC 1989»
14 years 1 months ago
Optimal Size Integer Division Circuits
Division is a fundamental problem for arithmetic and algebraic computation. This paper describes Boolean circuits of bounded fan-in for integer division  nding reciprocals that...
John H. Reif, Stephen R. Tate
ESA
2006
Springer
147views Algorithms» more  ESA 2006»
14 years 1 months ago
Univariate Polynomial Real Root Isolation: Continued Fractions Revisited
We present algorithmic, complexity and implementation results concerning real root isolation of integer univariate polynomials using the continued fraction expansion of real algeb...
Elias P. Tsigaridas, Ioannis Z. Emiris
TCS
2008
13 years 9 months ago
On the complexity of real root isolation using continued fractions
We present algorithmic, complexity and implementation results concerning real root isolation of integer univariate polynomials using the continued fraction expansion of real algeb...
Elias P. Tsigaridas, Ioannis Z. Emiris