Sciweavers

125 search results - page 15 / 25
» Model Theory Makes Formulas Large
Sort
View
POLICY
2005
Springer
15 years 2 months ago
Approximating Service Utility from Policies and Value Function Patterns
Service-oriented computing provides the right means for building flexible systems that allow dynamic configuration and on-the-fly composition. In order to realize this vision, ...
Steffen Lamparter, Daniel Oberle, Andreas Eberhart
96
Voted
ENTCS
2010
141views more  ENTCS 2010»
14 years 9 months ago
Debugging as a Science, that too, when your Program is Changing
Program debugging is an extremely time-consuming process, and it takes up a large portion of software development time. In practice, debugging is still very much of an art, with t...
Abhik Roychoudhury
APAL
2007
90views more  APAL 2007»
14 years 9 months ago
Guessing and non-guessing of canonical functions
It is possible to control to a large extent, via semiproper forcing, the parameters (β0, β1) measuring the guessing density of the members of any given antichain of stationary s...
David Asperó
JSYML
2008
72views more  JSYML 2008»
14 years 9 months ago
Perfect trees and elementary embeddings
An important technique in large cardinal set theory is that of extending an elementary embedding j : M N between inner models to an elementary embedding j : M[G] N[G] between ge...
Sy-David Friedman, Katherine Thompson
DBPL
1997
Springer
117views Database» more  DBPL 1997»
15 years 1 months ago
Degrees of Monotonicity of Spatial Transformations
We consider spatial databases that can be defined in terms of polynomial inequalities, and we are interested in monotonic transformations of spatial databases. We investigate a hi...
Bart Kuijpers