Sciweavers

1414 search results - page 111 / 283
» Combining Intruder Theories
Sort
View
148
Voted
GECCO
2009
Springer
156views Optimization» more  GECCO 2009»
16 years 9 days ago
Insight knowledge in search based software testing
Software testing can be re-formulated as a search problem, hence search algorithms (e.g., Genetic Algorithms) can be used to tackle it. Most of the research so far has been of emp...
Andrea Arcuri
SAGT
2009
Springer
177views Game Theory» more  SAGT 2009»
16 years 8 days ago
Characterizing Incentive Compatibility for Convex Valuations
We study implementability in dominant strategies of social choice functions when sets of types are multi-dimensional and convex, sets of outcomes are arbitrary, valuations for outc...
André Berger, Rudolf Müller, Seyed Hos...
SAGT
2009
Springer
102views Game Theory» more  SAGT 2009»
16 years 8 days ago
Free-Riding and Free-Labor in Combinatorial Agency
Abstract. This paper studies a setting where a principal needs to motivate teams of agents whose efforts lead to an outcome that stochastically depends on the combination of agent...
Moshe Babaioff, Michal Feldman, Noam Nisan
GLVLSI
2007
IEEE
187views VLSI» more  GLVLSI 2007»
16 years 2 days ago
DAG based library-free technology mapping
This paper proposes a library-free technology mapping algorithm to reduce delay in combinational circuits. The algorithm reduces the overall number of series transistors through t...
Felipe S. Marques, Leomar S. da Rosa Jr., Renato P...
LICS
2007
IEEE
16 years 14 hour ago
Environmental Bisimulations for Higher-Order Languages
Developing a theory of bisimulation in higher-order languages can be hard. Particularly challenging can be: (1) the proof of congruence, as well as enhancements of the bisimulatio...
Davide Sangiorgi, Naoki Kobayashi, Eijiro Sumii