Sciweavers

244 search results - page 6 / 49
» Towards a Theory of Extractable Functions
Sort
View
APAL
2008
77views more  APAL 2008»
14 years 12 months ago
More on SOP1 and SOP2
This paper continues [Sh500] and [DzSh692]. We present a rank function for NSOP1 theories and give an example of a theory which is NSOP1 but not simple. We also investigate the con...
Saharon Shelah, Alexander Usvyatsov
PPSN
2000
Springer
15 years 3 months ago
Towards Automatic Domain Knowledge Extraction for Evolutionary Heuristics
Domain knowledge is essential for successful problem solving and optimization. This paper introduces a framework in which a form of automatic domain knowledge extraction can be im...
Márk Jelasity
ICFP
2005
ACM
15 years 11 months ago
Toward a general theory of names: binding and scope
High-level formalisms for reasoning about names and binding such uijn indices, various flavors of higher-order abstract syntax, ry of Contexts, and nominal abstract syntax address...
James Cheney
WSCG
2000
84views more  WSCG 2000»
15 years 1 months ago
New Theory of Pattern Recognition on the Basis of Stochastic Geometry
The article offers a new approach towards the construction of recognition features independent of images' displacement or linear deformation. The distinguishing characteristi...
Nikolay G. Fedotov, Luydmila A. Shulga
CSFW
2000
IEEE
15 years 3 months ago
Towards Automatic Verification of Authentication Protocols on an Unbounded Network
Schneider's work on rank functions [14] provides a formal approach to verification of certain properties of a security protocol. However, he illustrates the approach only wit...
James Heather, Steve Schneider