11160 search results - page 259 / 2232 » Incompleteness in a General Setting |
170
click to vote
AUTOMATICA
2007
15 years 6 months ago
2007
This paper presents a new (geometrical) approach to the computation of polyhedral (robustly) positively invariant (PI) sets for general (possibly discontinuous) nonlinear discrete...
156
click to vote
CORR
2008
Springer
15 years 6 months ago
2008
Springer
The paper is organized as a self-contained literate Haskell program that implements elements of an executable finite set theory with focus on combinatorial generation and arithmet...
169
click to vote
MHCI
2009
Springer
16 years 13 days ago
2009
Springer
Whenever a pervasive game has to be developed for a group of children an appropriate multi-user setting has to be found. If the pervasive game does not support the children with a...
128
click to vote
ICCNMC
2005
Springer
15 years 11 months ago
2005
Springer
— The minimum disc cover set can be used to construct the dominating set on the fly for energy-efficient communications in mobile ad hoc networks. The approach used to compute ...
143
click to vote
LPNMR
2005
Springer
15 years 11 months ago
2005
Springer
Open answer set programming (OASP) is an extension of answer set programming where one may ground a program with an arbitrary superset of the program’s constants. We define a ...