Sciweavers

920 search results - page 159 / 184
» Generating Satisfiable Problem Instances
Sort
View
CAV
2004
Springer
126views Hardware» more  CAV 2004»
13 years 11 months ago
An Efficiently Checkable, Proof-Based Formulation of Vacuity in Model Checking
Model checking algorithms can report a property as being true for reasons that may be considered vacuous. Current algorithms for detecting vacuity require either checking a quadrat...
Kedar S. Namjoshi
HT
1991
ACM
13 years 11 months ago
Implementing Hypertext Database Relationships through Aggregations and Exceptions
In order to combine hypertext with database facilities, we show how to extract an effective storage structure from given instance relationships. The schema of the structure recogn...
Yoshinori Hara, Arthur M. Keller, Gio Wiederhold
GECCO
2010
Springer
169views Optimization» more  GECCO 2010»
13 years 11 months ago
Robust symbolic regression with affine arithmetic
We use affine arithmetic to improve both the performance and the robustness of genetic programming for symbolic regression. During evolution, we use affine arithmetic to analyze e...
Cassio Pennachin, Moshe Looks, João A. de V...
CAD
2004
Springer
13 years 7 months ago
A multi-resolution topological representation for non-manifold meshes
We address the problem of representing and processing 3D objects, described through simplicial meshes, which consist of parts of mixed dimensions, and with a non-manifold topology...
Leila De Floriani, Paola Magillo, Enrico Puppo, Da...
JIIS
2002
168views more  JIIS 2002»
13 years 7 months ago
Hidden Markov Models for Text Categorization in Multi-Page Documents
In the traditional setting, text categorization is formulated as a concept learning problem where each instance is a single isolated document. However, this perspective is not appr...
Paolo Frasconi, Giovanni Soda, Alessandro Vullo