Sciweavers

50 search results - page 6 / 10
» An Approach for Modeling the Name Lookup Problem in the C ...
Sort
View
VMCAI
2004
Springer
14 years 22 days ago
Approximate Probabilistic Model Checking
In this paper we deal with the problem of applying model checking to real programs. We verify a program without constructing the whole transition system using a technique based on...
Thomas Hérault, Richard Lassaigne, Fr&eacut...
EOR
2011
113views more  EOR 2011»
13 years 2 months ago
A relation-algebraic approach to simple games
Simple games are a powerful tool to analyze decision-making and coalition formation in social and political life. In this paper, we present relation-algebraic models of simple game...
Rudolf Berghammer, Stefan Bolus, Agnieszka Rusinow...
PLDI
1995
ACM
13 years 11 months ago
Corpus-Based Static Branch Prediction
Correctly predicting the direction that branches will take is increasingly important in today’s wide-issue computer architectures. The name program-based branch prediction is gi...
Brad Calder, Dirk Grunwald, Donald C. Lindsay, Jam...
BMCBI
2004
127views more  BMCBI 2004»
13 years 7 months ago
MolTalk - a programming library for protein structures and structure analysis
Background: Two of the mostly unsolved but increasingly urgent problems for modern biologists are a) to quickly and easily analyse protein structures and b) to comprehensively min...
Alexander V. Diemand, Holger Scheib
GPCE
2009
Springer
13 years 10 months ago
Mapping problem-space to solution-space features: a feature interaction approach
Mapping problem-space features into solution-space features is a fundamental configuration problem in software product line engineering. A configuration problem is defined as g...
Frans Sanen, Eddy Truyen, Wouter Joosen