Sciweavers

31387 search results - page 6002 / 6278
» Abstracting abstract machines
Sort
View
FLOPS
2008
Springer
15 years 8 months ago
Declarative Diagnosis of Missing Answers in Constraint Functional-Logic Programming
Abstract. We present a declarative method for diagnosing missing computed answers in CFLP(D), a generic scheme for lazy Constraint Functional-Logic Programming which can be instant...
Rafael Caballero, Mario Rodríguez-Artalejo,...
FMSB
2008
142views Formal Methods» more  FMSB 2008»
15 years 8 months ago
Generic Reactive Animation: Realistic Modeling of Complex Natural Systems
Abstract. Natural systems, such as organs and organisms, are largescale complex systems with numerous elements and interactions. Modeling such systems can lead to better understand...
David Harel, Yaki Setty
FOSSACS
2008
Springer
15 years 8 months ago
Footprints in Local Reasoning
Local reasoning about programs exploits the natural local behaviour common in programs by focussing on the footprint - that part of the resource accessed by the program. We address...
Mohammad Raza, Philippa Gardner
FPGA
2008
ACM
136views FPGA» more  FPGA 2008»
15 years 8 months ago
A complexity-effective architecture for accelerating full-system multiprocessor simulations using FPGAs
Functional full-system simulators are powerful and versatile research tools for accelerating architectural exploration and advanced software development. Their main shortcoming is...
Eric S. Chung, Eriko Nurvitadhi, James C. Hoe, Bab...
APPROX
2010
Springer
207views Algorithms» more  APPROX 2010»
15 years 8 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
« Prev « First page 6002 / 6278 Last » Next »