Sciweavers

4126 search results - page 641 / 826
» Set based logic programming
Sort
View
APPROX
2010
Springer
207views Algorithms» more  APPROX 2010»
15 years 4 months ago
Exploiting Concavity in Bimatrix Games: New Polynomially Tractable Subclasses
Abstract. We study the fundamental problem of computing an arbitrary Nash equilibrium in bimatrix games. We start by proposing a novel characterization of the set of Nash equilibri...
Spyros C. Kontogiannis, Paul G. Spirakis
113
Voted
ICSE
2008
IEEE-ACM
16 years 2 months ago
On the automation of fixing software bugs
Software Testing can take up to half of the resources of the development of new software. Although there has been a lot of work on automating the testing phase, fixing a bug after...
Andrea Arcuri
127
Voted
ESAW
2009
Springer
15 years 9 months ago
Normative Multi-Agent Organizations
Multi-agent systems are viewed as consisting of individual agents whose behaviors are regulated by organization artifacts. This abstract presents a programming language, which is d...
Mehdi Dastani
PASTE
2005
ACM
15 years 8 months ago
Generalizing symbolic execution to library classes
Forward symbolic execution is a program analysis technique that allows using symbolic inputs to explore program executions. The traditional applications of this technique have foc...
Sarfraz Khurshid, Yuk Lai Suen
OOPSLA
2004
Springer
15 years 7 months ago
AJEER: an aspectJ-enabled eclipse runtime
There are a number of technologies designed to improve modularity in software systems. The technique presented here combines two of them seamlessly to exploit their respective ben...
Martin Lippert