Sciweavers

7522 search results - page 1407 / 1505
» Spacing memetic algorithms
Sort
View
DLS
2008
149views Languages» more  DLS 2008»
13 years 10 months ago
Gradual typing with unification-based inference
Static and dynamic type systems have well-known strengths and weaknesses. Gradual typing provides the benefits of both in a single language by giving the programmer control over w...
Jeremy G. Siek, Manish Vachharajani
ESA
2008
Springer
148views Algorithms» more  ESA 2008»
13 years 10 months ago
Selfish Bin Packing
Following recent interest in the study of computer science problems in a game theoretic setting, we consider the well known bin packing problem where the items are controlled by se...
Leah Epstein, Elena Kleiman
APPROX
2010
Springer
207views Algorithms» more  APPROX 2010»
13 years 10 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
LREC
2010
180views Education» more  LREC 2010»
13 years 10 months ago
Parsing to Stanford Dependencies: Trade-offs between Speed and Accuracy
We investigate a number of approaches to generating Stanford Dependencies, a widely used semantically-oriented dependency representation. We examine algorithms specifically design...
Daniel Cer, Marie-Catherine de Marneffe, Daniel Ju...
GRAPHICSINTERFACE
2008
13 years 10 months ago
Quality scalability of soft shadow mapping
Recently, several soft shadow mapping algorithms have been introduced which extract micro-occluders from a shadow map and backproject them on the light source to approximately det...
Michael Schwarz, Marc Stamminger
« Prev « First page 1407 / 1505 Last » Next »