Sciweavers

72 search results - page 11 / 15
» Conflict Analysis in Search Algorithms for Satisfiability
Sort
View
KBSE
2010
IEEE
14 years 8 months ago
Solving string constraints lazily
Decision procedures have long been a fixture in program analysis, and reasoning about string constraints is a key element in many program analyses and testing frameworks. Recent ...
Pieter Hooimeijer, Westley Weimer
JCDL
2006
ACM
92views Education» more  JCDL 2006»
15 years 3 months ago
Probabilistic, object-oriented logics for annotation-based retrieval in digital libraries
In this paper we introduce POLAR, a probabilistic objectoriented logical framework for annotation-based information retrieval. In POLAR, the knowledge about digital objects, annot...
Ingo Frommholz, Norbert Fuhr
WWW
2008
ACM
15 years 10 months ago
Trust-based recommendation systems: an axiomatic approach
High-quality, personalized recommendations are a key feature in many online systems. Since these systems often have explicit knowledge of social network structures, the recommenda...
Reid Andersen, Christian Borgs, Jennifer T. Chayes...
ICCAD
2009
IEEE
147views Hardware» more  ICCAD 2009»
14 years 7 months ago
SAT-based protein design
Computational protein design can be formulated as an optimization problem, where the objective is to identify the sequence of amino acids that minimizes the energy of a given prot...
Noah Ollikainen, Ellen Sentovich, Carlos Coelho, A...
GECCO
2006
Springer
162views Optimization» more  GECCO 2006»
15 years 1 months ago
Improving evolutionary real-time testing
Embedded systems are often used in a safety-critical context, e.g. in airborne or vehicle systems. Typically, timing constraints must be satisfied so that real-time embedded syste...
Marouane Tlili, Stefan Wappler, Harmen Sthamer