1204 search results - page 116 / 241 » Termination of Polynomial Programs |
153
click to vote
WEA
2010
Springer
15 years 7 months ago
2010
Springer
Abstract. Mobile users are roaming in a zone of cells in a cellular network system. The probabilities of each user residing in each cell are known, and all probabilities are indepe...
205
click to vote
POPL
2006
ACM
16 years 1 months ago
2006
ACM
Abstract. This paper investigates what is essentially a call-by-value version of PCF under a complexity-theoretically motivated type system. The programming formalism, ATR, has its...
106
Voted
ICAC
2007
IEEE
15 years 7 months ago
2007
IEEE
System-S is a stream processing infrastructure which enables program fragments to be distributed and connected to form complex applications. There may be potentially tens of thous...
135
Voted
CEC
2011
IEEE
14 years 22 days ago
2011
IEEE
—Constrained Genetic Programming (CGP) is a method of searching the Genetic Programming search space non-uniformly, giving preferences to certain subspaces according to some heur...
116
Voted
LPNMR
2007
Springer
15 years 7 months ago
2007
Springer
Abstract. The recently proposed notion of an elementary set yielded a refinement of the theorem on loop formulas, telling us that the stable models of a disjunctive logic program ...