Sciweavers

3618 search results - page 136 / 724
» Additive functions for number systems in function fields
Sort
View
CADE
1992
Springer
15 years 8 months ago
Polynomial Interpretations and the Complexity of Algorithms
The ability to use a polynomial iterpretation to prove termination of a rewrite system naturally prompts the question as to what restriction on complexity this imposes. The main r...
Adam Cichon, Pierre Lescanne
132
Voted
GECCO
2006
Springer
185views Optimization» more  GECCO 2006»
15 years 7 months ago
Convergence to global optima for genetic programming systems with dynamically scaled operators
This work shows asymptotic convergence to global optima for a family of dynamically scaled genetic programming systems where the underlying population consists of a fixed number o...
Lothar M. Schmitt, Stefan Droste
MSCS
2006
97views more  MSCS 2006»
15 years 4 months ago
An extremely sharp phase transition threshold for the slow growing hierarchy
We investigate natural systems of fundamental sequences for ordinals below the Howard Bachmann ordinal and study growth rates of the resulting slow growing hierarchies. We consider...
Andreas Weiermann
166
Voted
ICEGOV
2009
ACM
15 years 1 months ago
A web-based performance monitoring system for e-government services
An e-Government portal represents not only a reputable public image of the sovereignty of a region, it is responsible for serving many users from local citizens and beyond, in a r...
Simon Fong, Ho Si Meng
FLOPS
2008
Springer
15 years 5 months ago
Rewriting and Call-Time Choice: The HO Case
It is known that the behavior of non-deterministic functions with call-time choice semantics, present in current functional logic languages, is not well described by usual approach...
Francisco Javier López-Fraguas, Juan Rodr&i...