Sciweavers

11231 search results - page 1974 / 2247
» Digging for Data Structures
Sort
View
ECAL
2007
Springer
15 years 7 months ago
Evolution of Cooperation in a Population of Selfish Adaptive Agents
Often the selfish and strong are believed to be favored by natural selection, even though cooperative interactions thrive at all levels of organization in living systems. Recent em...
Jorge M. Pacheco, Tom Lenaerts, Francisco C. Santo...
115
Voted
CAV
2010
Springer
214views Hardware» more  CAV 2010»
15 years 7 months ago
Learning Component Interfaces with May and Must Abstractions
elor Thesis: Demand Driven Abstraction Refinement • Advisor: Dr. Andrey Rybalchenko Kendriya Vidyalaya ONGC, Dehradun, Uttaranchal INDIA All India Senior Secondary Examination, ...
Rishabh Singh, Dimitra Giannakopoulou, Corina S. P...
134
Voted
CAV
2010
Springer
172views Hardware» more  CAV 2010»
15 years 7 months ago
Symbolic Bounded Synthesis
Abstract. Synthesis of finite state systems from full linear time temporal logic (LTL) specifications is gaining more and more attention as several recent achievements have signi...
Rüdiger Ehlers
113
Voted
CSFW
2010
IEEE
15 years 7 months ago
Approximation and Randomization for Quantitative Information-Flow Analysis
—Quantitative information-flow analysis (QIF) is an emerging technique for establishing information-theoretic confidentiality properties. Automation of QIF is an important step...
Boris Köpf, Andrey Rybalchenko
107
Voted
DAC
2010
ACM
15 years 7 months ago
An AIG-Based QBF-solver using SAT for preprocessing
In this paper we present a solver for Quantified Boolean Formulas (QBFs) which is based on And-Inverter Graphs (AIGs). We use a new quantifier elimination method for AIGs, which...
Florian Pigorsch, Christoph Scholl
« Prev « First page 1974 / 2247 Last » Next »