Sciweavers

4211 search results - page 610 / 843
» Types as Abstract Interpretations
Sort
View
JSYML
2007
75views more  JSYML 2007»
15 years 6 months ago
Stable definability and generic relations
Abstract. An amalgamation base p in a simple theory is stably definable if its canonical base is interdefinable with the set of canonical parameters for the φ-definitions of p ...
Byunghan Kim, Rahim Moosa
JUCS
2007
98views more  JUCS 2007»
15 years 6 months ago
Random k-GD-Sat Model and its Phase Transition
Abstract: We present a new type of sat problem called the k-gd-sat, which generalizes k-sat and gd-sat. In k-gd-sat, clause lengths have geometric distribution, controlled by a pro...
Milena Vujosevic-Janicic, Jelena Tomasevic, Predra...
UMUAI
2008
111views more  UMUAI 2008»
15 years 6 months ago
Mediation of user models for enhanced personalization in recommender systems
Abstract. Provision of personalized recommendations to users requires accurate modeling of their interests and needs. This paper proposes a general framework and specific methodolo...
Shlomo Berkovsky, Tsvi Kuflik, Francesco Ricci
ANOR
2002
99views more  ANOR 2002»
15 years 6 months ago
A General Approach to the Physician Rostering Problem
Abstract. This paper presents a hybridization of a Constraint Programming (CP) model and search techniques with Local Search (LS) and some ideas borrowed from Genetic Algorithms (G...
Louis-Martin Rousseau, Gilles Pesant, Michel Gendr...
ENTCS
2002
91views more  ENTCS 2002»
15 years 6 months ago
Memoization-Based Proof Search in LF - an Experimental Evaluation of a Prototype
Elf is a general meta-language for the specification and implementation of logical systems in the style of the logical framework LF. Proof search in this framework is based on the...
Brigitte Pientka