Sciweavers

1882 search results - page 321 / 377
» Transformational Programming and Forests
Sort
View
APPROX
2010
Springer
207views Algorithms» more  APPROX 2010»
14 years 11 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
DAGSTUHL
1996
14 years 11 months ago
Global Control for Partial Deduction through Characteristic Atoms and Global Trees
Recently, considerable advances have been made in the (on-line) control of logic program specialisation. A clear conceptual distinction has been established between local and glob...
Michael Leuschel, Bern Martens
CORR
2010
Springer
135views Education» more  CORR 2010»
14 years 10 months ago
Information Distance
While Kolmogorov complexity is the accepted absolute measure of information content in an individual finite object, a similarly absolute notion is needed for the information distan...
Charles H. Bennett, Péter Gács, Ming...
TASE
2008
IEEE
14 years 9 months ago
On Clamping Planning in Workpiece-Fixture Systems
Deformation at contacts between the workpiece and locators/clamps resulting from large contact forces causes overall workpiece displacement, and affects the localization accuracy o...
Caihua Xiong, Michael Yu Wang, You-Lun Xiong
ASE
2005
137views more  ASE 2005»
14 years 9 months ago
Rewriting-Based Techniques for Runtime Verification
Techniques for efficiently evaluating future time Linear Temporal Logic (abbreviated LTL) formulae on finite execution traces are presented. While the standard models of LTL are i...
Grigore Rosu, Klaus Havelund